$2.$ Consider the network shown below. Show the successive steps, from the start until the network stabilizes and any host can act as source, of the following routing algorithms:

a$.$ Distance vector routing $($Bellman$-$Ford algorithm$)$

b$.$ Link state routing $($Dijkstra algorithm$)$

Dijkstra's algorithm: another example

notes: Please solve as shown in reference example.

construct least$-$cost$-$path tree by tracing predecessor nodes

ties can exist $($can be broken arbitrarily$)$