QUESTION III. The distance between nodes matrix for a traveling salesman problem with seven (7) customers is given below. 1 3 6 2 7 1 1 3 4 7 5 5 7 5 2 4 2 6 5 3 5 2 3 7 1 7 3 6 7 2 5 2 4 3 4 5 6 7 3 3 5 5 5 7 2 5 2 2 4 5 5 2 3 4 5 Genetic Algorithm will be used to solve this problem. The features of the genetic algorithm are given below. Starter stack It will be produced randomly (Stack width is 5) Reproduction Tournament selection mechanism (Group size is 2) Cross 2 point crossover (crossover rate is 0.85) Mutation Mutation rate is 0.05 Considering the above features, run an iteration of all steps of the Genetic Algorithm to solve the Traveling Salesman Problem. Explain in detail the operations performed in all steps of the algorithm. Show the crossover and mutation operators by giving shape. In the event that the solution is disrupted as a result of crossing and mutation, the repair mechanism will be applied