Q$2$: $13$ pts$)$ For the edge weight matrix assigned to you for a directed graph, determine the shortest path weighs from veriex Vi to every other vertex using the Beffiman$-$Ford algorithm.

Show clearly the table $($with the distance estimate and predecessor$)$ for each iteration, as discussed in the slides.

Also, extract the shortest paths from VI to every other vertex in the graph, as shown in the slides. Clearly show the path extraction steps.

$\backslash$table$[[,V1,V2,V3,V4,V5$