• Analysis of Algorithms calss

Give an algorithm to detect whether a given undirected graph containsa cycle. If the graph contains a cycle, then your algorithm should output

one. (It should not output all cycles in the graph, just one of them.) Therunning time of your algorithm should be O(m + n) for a graph with n

nodes and m edges.

-Ifyou can provide a pesdo code would be better