1. Consider the maximum capacity path problem defined in Exercise 4.37. Modify the Floyd-Warshall algorithm so that it finds maximum capacity paths between all pairs of nodes.
2. Modify the Floyd-Warshall all-pairs shortest path algorithm so that it determines maximum multiplier paths between all pairs of nodes.
3. Show that if we use the Floyd-Warshall algorithm to solve the all-pairs shortest path problem in a network containing a negative cycle, then at some stage dk[i, i]