this interactive problemgiven simple undirected graph n vertex number 1 n task color vertex color c follow condition hold the set vertex color c connect s_c leq n_c2 n_c number vertice color c s_c sum degree vertice color c it show exist way color vertex condition hold initially give number n vertex degree vertex in query choose vertex u as response give kth edge incident u kth query vertex u you allow n queriesAn undirected graph simple contain multiple edge selfloopsthe degree vertex number edge incident a set S vertex connect different vertex u v S path pass vertex S connect u v that sequence edge u_1 v_1 u_2 v_2 dot u_k v_k k geq 1 u_1 u v_k v v_i u_i1 1 leq k u_k S v_k s 1 leq leq k especially set contain vertex connect