Using the Simulated Annealing Algorithm, find the shortest path for the datasets (see attached the txt files). Note that the solutions should contain nodes that have been visited only once and every node should be visited. You will have to submit the algorithms (pseudocode), codes (python) and a brief explanation of the algorithm and code, together with the solutions.

Do provide explanation along with the given solution

Dataset(matrix of distances between each node). This dataset must be access like a file and manipulated

0.0 3.0 3.0 4.0 4.0 0.0 5.0 0.0 4.0 6.0 4.0 2.0 7.0 2.0 7.0 6.0 3.0 5.0 8.0 0.0 6.0 6.0 0.0 3.0 8.0