Q:Question:More specifically, show that O(n 2 ) space can be achieved without sacrificing correctness by dropping the superscripts in the Floyd-Warshall algorithm by computing the distance matrices D(k) in place using a single matrix D. As it appears a@e, the Floyd-Warshall algorithm requires ?(n^3) space, since we compute d_i j^(k) for i, j, k=1,2, �, n. Show that the following procedure, which simply drops all the superscripts, is correct, and thusA:Answer:Logic For Floyd Warshall Algorithm: This algorithm...