a$)$ Use Dijkstra's algorithm in the network diagram above to find the paths with minimum cost

from node A to all others. Create a table with the steps of the algorithm.

b$)$ Assume that the host with IP address $192\mathrm{.}168\mathrm{.}1\mathrm{.}192$ communicates with the host which has an

IP address $192\mathrm{.}168\mathrm{.}2\mathrm{.}170.$ Calculate the Round$-$Trip Time $($RTT$)$ under the following conditions:

a$)$ The cost of each link corresponds to their natural length in kilometers $($as shown in the

Dijkstra diagram$).$

b$)$ All links have a transmission rate of $1G\frac{b}{s}.$

c$)$ Packets have a size of $1500$ bytes.

Also, assume that the processing time of packets, waiting in the queue, and transmission on

the LAN are zero.