An undirected graph G = (V,E) is said to be k-colorable if all of the vertices of G can be colored one of k di erent colors such that no two adjacent vertices are assigned the same color. Design an algorithm based on BFS that either colors a graph with 2 colors or determines that two colors are not sucient. Argue that your algorithm is correct.