The Traveling Salesman Problem (TSP) is NP-compIete. Write a polynomial-time approximation algorithm for TSP. Apply the algorithm to the following graph to determine an approximate tour and evaluate its approximation ratio against the optimal solution: Graph: Nodes: A, B, C, D, E A->B:4,A->C:2,A->D:5,A->E:6, B->C:3,B->D:2,B->E:7 C->D:1,C->E:4 D->E:3