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. For this problem, you are asked to design a Tabu Search algorithm (which can be added to the VNS or Genetic Algorithm design). Based on the example given below; a) Draw and fill a tabu table for the problem. Explain your tabu criteria. b) Demonstrate and explain the choices of your algorithm by drawing a few iterations. c) Show how the tabu table is updated according to the choices of your algorithm. (Based on this sub graph, show the iterations with the lower graph in red as the starting point.)