Please Answer ALL THE QUESTIONS

Artificial I ntelligence Assignment #2 1. I mplement a genetic algorithm to find a solution to the Traveling Salesman Problem for the following dist ance matrix 8 9 10 11 12 13 1415 3 10 12 4 2 9 4 5 174185- 6 132 20 3 - 7 19 7111 5 18 8 11 1914 8 6 20 9 6 12 16 19 2 4912- 10 5 131 11 1714 20 11 5155 20 814 12 1 3 27 12 713 2 13 14 14 13 12 7616 8 10 3616 10 15 1 14 7 18155 8 16 18 3 15 20 8 13 9 15 1016 18 2 17 9 199 3 1914 7 1- 6 3 10711 I nstructions There are 15 cities indicated by 1-15. The distance from city 1 to city 1 is not hing. The distance from city 2 to city 1 is 1. The distance from city 3 to city 1 is 10, and so forth . .Write the algorithm in pseudo code or in any notation you want that finds the shortest route to take between the cities. You do not need to implement the algorithm in a programming language You are just defining and describing a solution to the Traveling Salesman Problem using the infor mat ion in the chart