An undirected bipartite graph G(V, E) is one where its nodes can be partitioned into two disjoint sets V = V1 V2, such that every edge e E is an arc {v1, v2}, where v1 V1 and v2 V2. Note that, in a bipartite graph, the length of every cycle must be an even number. Define a pseudo-code for an algorithm to determine whether an undirected graph is bipartite with worst-case complexity O(m), where m is the number of edges in the graph.