(a) What is the complexity of Floyd’s matrix approach (described in Section 2.7) for finding the minimum paths from all nodes to all other nodes? (b) How does this compare to the complexity of using...

(a) What is the complexity of Floyd’s matrix approach (described in Section 2.7) for finding the minimum paths from all nodes to all other nodes?

(b) How does this compare to the complexity of using Dijkstra’s algorithm for finding the shortest path tree rooted at a single node once for each root node of the network?