As it appears above, the Floyd-War shall algorithm requires (n3) space, since we compute for d (k)

As it appears above, the Floyd-War shall algorithm requires Θ (n3) space, since we compute for d (k) i, j, k = 1, 2,...,n. Show that the following procedure, which simply drops all the superscripts, is correct, and thus only Θ (n2) space is required.