Problem 2: Finding the shortest cycle. Design an algorithm that given an undirected and unweighted graph G, finds the shortest cycle in G. Note that a cycle cannot repeat vertices, and that its length is equal to the number of edges it contains. Prove that your algorithm is correct and that it runs in polynomial time. Problem 2: Finding the shortest cycle. Design an algorithm that given an undirected and unweighted graph G, finds the shortest cycle in G. Note that a cycle cannot repeat vertices, and that its length is equal to the number of edges it contains. Prove that your algorithm is correct and that it runs in polynomial time