a$)$ Apply Dijkstra'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 $5+$ MAX$\_$NUM$\_$ID in all your calculations and solution.

b$)$ Apply again Dijkstra's and Bellman Fond 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.