The minimum vertex cover problem is stated as follows: Given an undirected graph G = (V,E) with N vertices and M edges. Find a minimal size subset of vertices X from V such that every edge (u,v) in E is incident on at least one vertex in X. In other words you want to find a minimal subset of vertices that together touch all the edges. For example, the set of vertices X = {a,c} constitutes a minimum vertex cover for the following graph: a---b---c---g /\| /\| def Formulate the minimum vertex cover problem as a Genetic Algorithm or another form of evolutionary optimization. You may use binary representation, OR any representation that you think is more appropriate. you should specify: A fitness function. Give 3 examples of individuals and their fitness values if you are solving the above example. 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 minimum vertex cover problem if pos- sible without running indefinitely.