In all the algorithms, always explain their correctness and analyze their complexity. The complexity should be as small as possible.

Question 2: Give an algorithm (using BFS) which finds the shortest cycle simple in an undirected graph (the cycle that has the least number of edges and every vertex appears at most 1)