$(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.