Question $8$

$($a$)$ Find the cost and next hop $($i$.$e$.,$ routing table entry$)$ of the least cost path from node $1$ to every other node for the following graph using Dijkstra's algorithm.

$($b$)$ Consider the distance vector routing approach and assume link $4-5$ changes in cost from $6$ to $2.$ Illustrate the process $($i$.$e$.,$ the flow of information$)$ that would result in node $1$ updating its routing table.