a$.$ Suppose each node runs the Distance Vector Routing Protocol. Complete the table below to show,

step$-$by$-$step, how to find the shortest path from each node to destination node F$.$ Each entry in columns

A through $E$ should be of the form $($NextHop$,$ Cost$).$

b$.$ Suppose the link between nodes $F$ and $E$ is broken $($removed$)$ after the protocol converges in part a$.$

Show step by step how the protocol continues until it converges again.

Consider the network in the figure below. Use Dijkstra's algorithm to identify the shortest paths from node

$B$ to all other nodes. Show your work.