The minimum k-cardinality tree problem is based on finding a G subtree with full k edges with minimum sum of weights for a given G graph. This problem is a discrete optimization problem in NP-hard difficulty.

You are asked to design a Genetic Algorithm for this problem. Based on the example given below;

a) Show how you would represent the problem space (chromosomes).

b) Determine the constraints of your problem and the objective function.

c) Describe the approach your algorithm will follow in the intensification and diversification stages (crossover and mutation).

Demonstrate and explain the choices of your algorithm through the example by drawing a few iterations.

(Based on this sub graph, show the iterations with the lower graph shown in red as the starting point.)