program in python

Let A be a tridiagonal matrix, and denoted in three arrays a, b, and c: A = [a, b, c] with a =(a1, 42, ..., an), b =(b1,b2, ..., bn), and c =(C1, C2, ..., Cn). Here an=0 and cn=0. For example, A with n = 4 is in the form A =[b c1 0 o ai b2 C2 0 0 a2 b3 C3 0 0 a3 b4] Problem 1: Find the Crout factorization of A: A = LU with L in arrays and U in array u.For example, L with n = 4 is in the form L =[ ai 0 0 0 1 2 0 0 2 0 0 0 B3 04] and U with n = 4 in the form U = [1 u10 0 0 1 U2 0 0 0 1 0 0 0 1] Program the Crout factorization method for solving the linear system Ax=f by reusing arrays a, b, c, and f to store L, U and the solution X. Let A be a tridiagonal matrix, and denoted in three arrays a, b, and c: A = [a, b, c] with a =(a1, 42, ..., an), b =(b1,b2, ..., bn), and c =(C1, C2, ..., Cn). Here an=0 and cn=0. For example, A with n = 4 is in the form A =[b c1 0 o ai b2 C2 0 0 a2 b3 C3 0 0 a3 b4] Problem 1: Find the Crout factorization of A: A = LU with L in arrays and U in array u.For example, L with n = 4 is in the form L =[ ai 0 0 0 1 2 0 0 2 0 0 0 B3 04] and U with n = 4 in the form U = [1 u10 0 0 1 U2 0 0 0 1 0 0 0 1] Program the Crout factorization method for solving the linear system Ax=f by reusing arrays a, b, c, and f to store L, U and the solution X