$5(10+10$ pts$),$ Given following computer networks,

$1)$ Use Dijkstra's shortest path algorithm to compute the shortest path from $\backslash ($ A $\backslash )$ to all network nodes. Show work$/$table$.$ Show final next hop routing table$/$forwarding table for A $.$

$2)$ Use Bellman$-$Ford algorithm to show shortest distance from each node to A$.$ Show work$/$table$.$ Show final next hop routing table values for each node to A$.($Assuming that the algorithm begins with each node knowing only the costs to its immediate neighbors$)$

$6(10$ pts$),$ Suppose a router interconnects three subnets. All of the subnets will have the prefix $\backslash (211\mathrm{.}1\mathrm{.}16/24\backslash ).$ Subnet $1$ is required to support $62$ interfaces, Subnet $2$ will need to support $95$ interfaces and Subnet $3$ will need to support up to $16$ interfaces. Provide three network address of the form a$.$b$.$c$.$d$/$x that satisfy these constraints.

$7(10$ pts$),$ You use Dijkistra's algorithm for finding the shortest path in a graph between all pairs of nodes. Can you use the same algorithm and change it in some way to find the longest path?

$8(10$ pts$),$ Consider a general topology and a synchronous version of the distancevector algorithm. Suppose that at each iteration, a node exchanges its distance vectors with its neighbors and receives their distance vectors. Assuming that the algorithm begins with each node knowing only the costs to its immediate neighbors, what is the maximum number of iterations required before the distributed algorithm converges? Justify your answer.