This is an Artificial Intelligence problem. Please solve the problem using MATLAB and provide working codes without any errors. Also, provide answers to the questions pertaining to the problem typed out.

Problem:

Questions 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. i. 1. (10 points) Define the TSP mathematically. 2. (15+15 points) Define: the representation of TSP used to solve using GA. ii. the representation of TSP used to solve using SA. (15+15 points) Mathematically define the: i. fitness function for TSP for GA. ii. objective function for TSP for SA. 3. 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)