use this algorithm to create a code to find the LU decomposition of a banded matrix. test your code with the matrix given.

Algorithm: LU Decomposition for Banded Matrices. Given a real, banded, nxn matrix A which requires no pivoting, the following the upper triangular part of A by U: for k=1:n-1 for i =k+1:k+p-1 lik = dik akk for j =k+1:k+9-1 dij = dij - likakj end end end A= [ 1 2 2 5 | 0 3 0 0 0 0 1 0 0 0 0 1 0 7 2 -2 9 0 3 0 0 0 0 0 -1 10 2 0 0 0 0 1 20