A graph (V, E) is bipartite if the vertices V can be partitioned into two subsets L and R, such that every edge has one vertex in L and the other in R. Design an efficient algorithm that determines whether a given undirected connected graph is bipartite. Write down the pseudocode, analyze its running time and prove that your algorithm is correct.