$(6$ Points$)$ Find the shortest path to node A from every other node in the weighted graph below. Apply

the backward dynamic programming algorithm. Let $V^{**}(s)$ be the shortest$-$path length from node $s$ to

A and $V_i(s)$ be the estimated shortest$-$path length in the $i$ th iteration of the dynamic programming

algorithm. Show the values for $V_0(s),V_1(s),$ and $V_2(s)$ as well as $V^{**}(s)$ for all nodes in the graph.