Let a random $4$x$4$ matrix represent the adjacency matrix for a graph with $4$ nodes V$=\{$A$,$Z$,$C$,$D$\}$

Draw the graph. Make sure to set the weights between $-2$ and $2.$

Part $1$b:

Run the first $2$ iterations of Bellman$-$Ford on the graph above. Show both d array and pi array.

Part $1$c:

Now chante all the negative weights in the graph above to positive weights$+3.$ so if the weight is $-2$ it becomes $2+3=5.$

Run Dijstra on the graph showing the Extract min actions and working through the adj. lists of each popped nodes as we did in class. Show both d array and pi array.