Consider a 6-city traveling salesman problem whose links have the associated distances shown in the following table. City 2 4 1 13 251521 26 21 29 21 1118 23 10 13 12 4 City 1 is the home city. Starting with the initial trial solutions listed below; apply the first iteration of Genetic Algorithms. State the rule you will use to assess fitness values. Set your crossover point between the 4th and 5th digits of the given solutions. List the children solutions obtained, the fitness values for the parent and children solutions and the parent solutions for the next iteration. Assume no mutation takes place. Make sure to explain the reasoning behind your answers. Sol 1: 1-2-3-4-5-6-1 Sol 2: 1-3-4-2-6-5-1 Consider a 6-city traveling salesman problem whose links have the associated distances shown in the following table. City 2 4 1 13 251521 26 21 29 21 1118 23 10 13 12 4 City 1 is the home city. Starting with the initial trial solutions listed below; apply the first iteration of Genetic Algorithms. State the rule you will use to assess fitness values. Set your crossover point between the 4th and 5th digits of the given solutions. List the children solutions obtained, the fitness values for the parent and children solutions and the parent solutions for the next iteration. Assume no mutation takes place. Make sure to explain the reasoning behind your answers. Sol 1: 1-2-3-4-5-6-1 Sol 2: 1-3-4-2-6-5-1