An undirected graph G $=($V$,$ E$)$ is called bipartite if V can be partitioned into two

disjoint subsets, A and B$,$ such that for each edge $($u$,$ v$),$ u in A and v in B$.$ Give pseudocode for

an O$($V$+$E$)$ algorithm to determine whether a given connected undirected graph is bipartite.

Hint: Use BFS$.$