The graph k-coloring problem is stated as follows: Given an undirected graph G = (V, E) with N vertices and M edges and an integer k. Assign to each vertex v in V a color c(v) such that 1 c(v) k and c(u) = c(v) for every edge (u,v) in E. In other words you want to color each vertex with one of the k colors you have and no two adjacent vertices can have the same color. For example, the following graph can be 3-colored using the following color assignments: a=1,b=2,c=1,d=2,e=3,f=2,g=3 a---b---c---g /\| /\| d --- e f Formulate the graph k-coloring problem as an evolutionary optimization. You may use a vector of integer representation, OR any representation that you think is more appropriate. you should specify: A representation. A fitness function. Give 3 examples of individuals and their fitness values if you are solving the above example. 1 A set of mutation and/or crossover and/or repair operators. Intelligent operators that are suitable for this particular domain will earn more credit. A termination criterion for the evolutionary optimization which insures that you terminate with a valid solution to the graph k-coloring problem if possible without running indefinitely.