Please help me answer this question.

Q8 [ 6 marks] Let G=(V,E) be an undirected graph. G is bipartite if all vertices v1,v2,,vk I V, where k>=2, can be divided into two independent sets, V1 and V2 such that every edge {x,y} either x belongs to V1 and y to V2, or x belongs to V2 and y to V1. Give a clear description of algorithm to determine whether or not a given undirected graph G=(V,E) is bipartite. Your algorithm's worst-case time complexity must be in O(V2). Justify that your algorithm is correct and has the required time complexity