i only need answer for question $9$ but you need the table from question $8.$ Plz answer step by step. thank you. $(0\mathrm{.}5)$ The following adjacency matrix is given for the Traveling Salesman Problem.

Using a Dynamic Programming approach, What is the bound of the path $D[4]\{2,3,5\}$ if we

assume that the begining and ending of the shortest path is vertex $V_1?.$ Show all your work

to get credit, including all the work needed in your state$-$space tree to get that solution.

$(0\mathrm{.}5)$ Use the adjacency matrix from problem #$8$ to compute the TSP problem $($minimum

distance$)$ using a Branch and Bound approach. Assume $V_1$ is the source node. Show all your

work to get credit, including all the bounds needed in your state$-$space tree, and the way you

prune the branches step by step.