Let G (V, E) be a given graph where |VI N and |EI M. Suppose we wish to color each node of G either black or white such that no two adjacent nodes share the same color. Assume without loss of generality that the initial node visited in the graph is to be colored black. Design an O(N M) time algorithm to provide such a coloring or determine that none exists Example: the triangle graph does not have such a coloring, but the square graph does. (20 pts.)