Given a connected undirected graph G described by an adjacency list representation design an efficient algorithm to find a path in G that goes through exactly once in each direction .Your algorithm should print out the edges in the direction and order in which they are traversed ,i.e...,printing out (u,v),(v,w),(w,v),(v,u) means going from u to v to w to v to u.Argue correctness of your algorithm and analyse its runnig time.