My max number id is $26$ and min number id is $0.$SUBJECT $4(30\%)$

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 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 $5$ should be considered $5+$ MAX$\_$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.

The tables and iterations of the algorithms should be as in our examples. And all calculations should be very clear.