$4.$ For the following graph, apply Bellman$-$Ford algorithm to find the shortest path distance from vertex A to all other vertices. You need to show the recurrence formula $($which is in the textbook$),$ and show the update of the table dist $\backslash (^\{$k$\}[$u$]\backslash )$ for all the $\backslash ($ k $\backslash )$ and $\backslash ($ u $\backslash )($similar to Figure $5\mathrm{.}10,$ in the textbook, p$.291).$ You don't have to show the shortest path as a sequence of vertices.

Continues on the next page $.......$