Part B $($Travel Salesman Problem$)$: Given the graph below, sketch out all the possible path permutations that are possible. Also, determine which path permutation$($s$)$ yields the minimum cost to travel. Assume that node $A$ is the starting and ending node.

Part C $($Travel Salesman Problem $($cont$\text{'}$d$))$: Using Python, C$++,$ or Java, write a program that that take the nodes and weight edges in Part B$,$ and determines the minimum cost to travel. Below is an example output for what your solution display if written correctly:

$\backslash$table$[[$edwarddillonCEdwards$-$MacBook$-$Air$-211-16-2023\%$ python$3$ TSP$.$py$],[$The minimum path is: $29],[$edwarddillonCEdwards$-$MacBook$-$Air$-211-16-2023\%$