Computer Network Assignment

Need Source Code and a ReportMidterm$2$ Part$2$: Talce$-$home Question

The following question will be assigned as a take$-$home question. In addition to solving the

flem by pen and pencil, you will need to do the following.

Create a program in your preferred programming language to solve this problem.

Display the following at each iteration until the problem is solved.

To which node, the shortest distance from A has been found in that iteration

The nodes for which distances from A have been reduced in that iteration

How the parents of those nodes have been changed in that iteration.

Also, provide a detailed explanation of the outputs of each iteration

At the end of a program run, display the routing table shown below.

Submission: zip the following and name MD$\_$SD$\_$lastuame$\_$Firstname.docsipdf

Source code

A report that includes a screenshot of a program run and an explanation of each

iteration, pen$-$paper work for $Ql$

Q$1(12$ pts$)$ Consider the following graph of routers with the node A as the source. You want

to apply Dijkstra's algorithm to find the shortest distances and paths to every other node in

the graph. Now, consider the moment when you have just found the shortest distance to

nods $E$ and distances relevant to that event have been updated. What will be the distances

and next hop for forwarding? Present the values using the table below and all the

intermediate results in the next page.