Implement Heuristic Algorithm:
a. Below matrix represents the distance of 5 cities from each other. Represent it in the form of a graph

A B C D E
A 0 2 3 0 1
B 2 0 15 2 0
C 3 15 0 0 13
D 0 2 0 0 0
E 1 0 13 9 0

b. Apply Nearest-neighbor heuristic to this matrix and find the approximate solution for this matrix if it were for TSP problem.
c.What is the approximation ratio of your approximate solution?
d. Implement the nearest neighbor heuristic for TSP problem. Consider the first node as the starting point. The input Graph is provided in the form of a 2-D matrix. Name your function solve_tsp(G). Name your file TSP.py
Sample input
G: [[0,1,3,7), (1,0,2,3],[3,2,0,1), (7,3,1,0]]
Output : 11