B2 a) Show how to modify the Floyd-Warshall algorithm to compute the shortest path lengths in a graph where the length d each path is defined to equal the length of the longest edge on the path (instead of the sum of edge lengths) b) Show how to modify the Floyd-Warshall algorithm to compute the shortest path lengths in a graph where the length of each path is defined to equal the product of the lengths of the edges on the path (instead of the sum of edge lengths) ) A technical requirement for the original problem is that the graph have no negative cycles. For this product version, you can assume that all edges have positive lengths, but there is still a technical requirement about cycles. What is that requirement, and why