you give undirecte unweighted connected graph consist n vertex m edge it guarantee selfloop multiple edge give graphYour task find span tree graph maximum degree vertice maximum possible Recall degree vertex number edge incident