Solve and explain pls This is the Traveling Salesman Problem
The optimal path for the TSP for a graph represented by the matrix , is given by the formula g(, S) = min (cik +gk,S-(k))) keS 218- 3 10 52 4 8 4 7 C’= g(4,2) Show transcribed image text The optimal path for the TSP for a graph represented by the matrix , is given by the formula g(, S) =
OR
OR