Solve this python programming code question. Here is a picture of my code so far

In this activity, we will do some exploring of timing different alorgithms for solving linear systems. We will start by timing solving a linear system in 3 different ways. Let's define the following system: And let b be a vector going from 0 to n - 1. Define these arrays for n = 10. Solve this Ax = For the autograder define the follow: 2 1 A = 0 A4 is x (found with solve) A5 is L (when we do LU decomposition) A6 is U ... A7 is y A8 is x (found with LU decomp) A9 is A-1 A1 is A A2 is the condition number of A (To check that A is notsingular) A3 is n -1 2 1 LOO 00 -1 2 : -1 : : 000 0 ... : 0 0 0 0 0 b system 3 ways and time the calculations. Use Gaussian elimination (the 'solve' function), LU decomposition, and matrix inverse. : 1 N... 2