This is an artificial intelligence problem. Please provide answer to the question pertaining to the problem typed out. Clearly label which part of the answer is for question i and ii.

Question pertaining to the problem:

Solve the Travelling Salesman Problem (TSP) using two algorithms: genetic algorithm (GA) and simulated annealing (SA). The algorithms should be used independently to solve the problem. Besides the textbook, there are many resources in the Internet that you can use. However, make sure to properly reference any source (e.g. paper, code) you have used. 4. (15+15 points) Compare the two algorithms using: i. the accuracy of your solution. ii. the time in seconds) required to reach convergence. Show convergence plot for each algorithm. Calculate time taken using an in-built function (e.g., "tic toc" in Matlab). Solve the Travelling Salesman Problem (TSP) using two algorithms: genetic algorithm (GA) and simulated annealing (SA). The algorithms should be used independently to solve the problem. Besides the textbook, there are many resources in the Internet that you can use. However, make sure to properly reference any source (e.g. paper, code) you have used. 4. (15+15 points) Compare the two algorithms using: i. the accuracy of your solution. ii. the time in seconds) required to reach convergence. Show convergence plot for each algorithm. Calculate time taken using an in-built function (e.g., "tic toc" in Matlab)