Answer it

Given 2 colors (i.e. Red and Blue) and an undirected graph G(V,E), we seek to assign a color to each vertex such that for any edge (u,v) E,u and v are assigned different colors. Is there such a color assignment for the graph G? If yes, then return such a color assignment, i.e. the color assigned to each vertex. If not, then return a message "No color assignment possible". Design a Brute Force (Exhaustive Search) algorithm to solve this problem. (8 pts) Write the pseudo-code (2 pts) Analyze the worst-case running time. Note the following: solve this problem. (8 pts) Write the pseudo-code (2 pts) Analyze the worst-case running time. Note the following: 1. For the exhaustive search, you must use one of the combinatorial objects. 2. All other solutions will not receive credit