Your company has two offices located approximately one kilometer apart. There isa need to transfer data between the two offices at speeds up to 100 Mbps. Design two solutions that are technically and financially feasible for interconnecting the two buildings. Provide appropriate justification to support the proposed solution.

Question 2. Using Dijkstra's Least Cost algorithm, Find the least cost path from Node A to all other nodes fort he weighted graph showing Figure below.

Transcribed Image Text:

B F No E A D C G B F No E A D C G