Assume a connected graph. Use breadth-first search as the base of the algorithm. Assume the adjacency list representation of a graph. Explain why the algorithm runs in time O(m + n)

2. Give an algorithm to detect whether a given undirected graph contains a cycle. If the graph contains a cycle, then your algorithm should output one. t should not output all cycles in the graph, just one of them.) The running time of your algorithm should be O(mn) for a graph with rn nodes and m edges