Explain how to implement Warshall’s algorithm without using extra memory for storing elements of the algorithm’s intermediate matrices. You need to show that we can simply overwrite elements of R(k-1) with elements of R(k) without any other changes in the algorithm.

6. Numpy.linalg https://numpy.org/doc/stable/reference/generated/numpy.linalg. solve.html. Generate a random, square matrix and random vector using numpy and then solve using numpy.linalg.solve(). Confirm it is a solution using 'A.dot (x)' where x is the solution from solve(). import numpy as np n=100 Numpy has its own black-box linear system solver numpy.linalg.solve(): A=np.random.rand (n,n) b=np.random.rand (n,1) I

If we need to put vector in Raw function, how can we do that?

Very confused about this problem. Any help is appercaited