Using the A* Algorithm and 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.

0.0 3.0 4.0 2.0 7.0

3.0 0.0 4.0 6.0 3.0

4.0 4.0 0.0 5.0 8.0

2.0 6.0 5.0 0.0 6.0

7.0 3.0 8.0 6.0 0.0

I cannot attach the text file. It contains only this matrix as follows:

0.0, 3.0, 4.0, 2.0, 7.0

3.0, 0.0, 4.0, 6.0, 3.0

4.0, 4.0, 0.0, 5.0, 8.0

2.0, 6.0, 5.0, 0.0, 6.0

7.0, 3.0, 8.0, 6.0, 0.0