Convert the algorithm to a Python program.     ALGORITHM Matrix Multiplication(A[0..n-1, 0..n -1], B(0,n-1,0..n -1) //Multiplies two square matrices of order n by the definition-based algorithm  //input: Two n x n matrices A and B / /Output: Matrix C = AB  for i← 0 to n-1 do for j ←0 to n- 1 do C[i. j] =0.0  for k 0 to n - 1 do C[i. jl ←C[i. j] + A[. k]* B|k. j]  return C

Another recursive algorithm is applied to some data A = (a₁, ..., am) where m = 2* (i.e. 2, 4, 8,16 ...) where x is an integer ≥ 1. The running time T is characterised using the following recurrence equations: T(1) = c when the size of A is 1 T(m) = 2T (2) + c otherwise Determine the running time complexity of this algorithm.

Pls Use Python Using NumPy, write the program that determines whether the A=({{1, 5, -2}, {1, 2, -1}, {3, 6, -3}}) matrix is ​​nilpotent.  Itro: Nilpotent Matrix: A square matrix A is called nilpotent matrix of order k provided it satisfies the relation, Ak = O and Ak-1≠O where k is a positive integer & O is a null matrix of order k and k is the order of the nilpotent matrix A . The following picture is an example of the intro:   Ps: Please also explain step by step with " # "

PYTHON -LU factorization  (please see attached image for full question).