Max$\_$Id$\_$Num$=4$ a$)$ Apply Dijkstra's and Bellman Ford algorithms to the following

network topology. Each link weight currently W should be considered W$+4$ For instance weight A$-$C which in the graph is S should be considered $5+4$ in all your calculations and solution.a$)$ Apply Dijkstra's and Belliman Ford algorithms to the following network topology. Each link weight

currently W should be considered W$+4$ For instance weight A$-$C which in the graph is $5$

should be considered S$+4$ in all your calculations and solution.

b$)$ Apply again Dijkstra's and Bellman Ford algorithms to the following network topology. But now each link

weight currently W should be considered $-$W$-4$ For instance weight A$-$C which in the

graph is $5$ should be considered $-5-4$ in all your calculations and solution.

b$)$ Apply again Dijkstra's and Bellman Ford algorithms to the following network topology. But now each lin! weight currently W should be considered $-$W$-4$ For instance weight A$-$C which in th graph is $5$ should be considered $-5-4$ in all your calculations and solution.Consider again the $5$ decimal numbers of your $5$ letters student exam ID has been transformed into. Take the MAXIMUM number out of these $5$ numbers $=$ MAX$\_$NUM$\_$ID

a$)$ Apply Dijksts's and Bellman Ford algorithms to the following network topology. Each link weight currently W should be considered W$+$MAX$\_$NUM$\_$ID$.$ For instance weight A$-$C which in the graph is S should be considered S$+$M$.$AX$\_$NUM$\_$ID in all your calculations and solution.

b$)$ Apply again Dijkstra's and Bellman Ford algorithms to the following network topology. But now each link weight currently W should be considered $-$W$-$ MAX$\_$NUM$\_$ID$.$ For instance weight A$-$C which in the graph is $5$ should be considered $-5-$MAX$\_$NUM$\_$ID in all your calculations and solution.