= An undirected graph G = (VE) is called bipartite if the vertices can be partitioned into two subsets U and V in such a way that all edges go between U and V. U M a) (15 pts) Prove that a graph is bipartite iff it can be 2-colored, that is iff all nodes can be colored with two colors so that no two adjacent nodes have the same color. b) (20 pts) Implement an efficient algorithm to decide whether a graph is bipartite. Write its code in IS_BIPARTITE function. Explain your code in detail. Note: You can use Python or Java programming language depending on your preference. Hint: You can solve this problem with just 25-30 lines of code. IS BIPARTITE ( .) return result