please answer question $2,$

Question $1.$ Consider the network given in the following figure. Apply Dijkstra's algorithm to

find the least$-$cost routes from Node A to each one of the other nodes. Show clearly all your

steps in a table. $($Note: you should use Dijkstra's algorithm and show that usage in your table. If you guess the

routes by looking at the topology and not apply the algorithm you will not get any point.$)$

Question $2.$ Consider the network topology given in Question $1$ where packets flow only in

one direction and the pure flooding algorithm for routing, when A sends a packet to I how

many packets will I receive? Develop and explain clearly.