Travelling Salesman Problem --

6 20 14 10 2 818 12 (15pts) Solve the TSP problem for this graph, assuming a as the starting vertex for the travelling salesman, by a) Listing all possible circuits starting with vertex a, with corresponding total weight. Identifying the circuit with the minimum total weight b) (5pts) Assume now that instead of 5 nodes, you had a graph with 10 nodes. How many possible circuits are there starting at a given node