Draw an edge$-$weighted graph with $7$ nodes to be used as a model, in routing calculations for an

internet.

a$.$ Show the initial distance vectors at three different nodes, at the start of their execution of the

Distance Vector Routing algorithm.

b$.$ Show the updates of distance vectors at three different nodes, after each of the three nodes

receives three distance vectors, from other nodes.

c$.$ Show the initial shared Link State Database created at the nodes, at the start of the execution

of the Link State Routing Algorithm, at each node.

d$.$ Show the next three link state packets that will be created and sent out by $3$ chosen nodes.

Show the corresponding Link State Database updates that results. Then, show the construction

of least cost trees that occurs at two nodes, using Dijkstra Algorithm.

Please I want this answer real bad $.$ I have been asking for more than $5$ times still no a satisfied answer. Please please can you do this one in a handwritten form please