Q$3$: $20$ pts$)$ For the edge weight matrix assigned to you for a directed graph, determine the shortest path weights from vertex V$1$ to every other vertex using the Bellman$-$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 V$1$ to every other vertex in the graph, as shown in the slides. Clearly show the path extraction steps.