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.