8. Solve the Traveling Salesperson problem using the Exhaustive Search design technique discussed in class. The salesperson must begin and finish the tour in City B. \begin{tabular}{| CICCICICI} Thline & A & B & C & D \hline A & INF & 4 & 7 & 6 \hline B & 4 & INF & 5 & 3 \hline C & 7 & 5 & INF & 3 W \hline D & 6 & 3 & 3 & INF \hline \end{tabular) a. Draw the graph using the data from this adjacency matrix. (3 points) b. State every possible path and its corresponding distance. (6 points) c. Cross out the redundant paths, so no remaining path is an exact reverse of another path. (3 points) d. State an optimal solution. (3 points) CS.VS. 1109|