## forward/backward elimination

hi. can anyone help me with this?

Using factorisation for solving systems of linear equations. A factorisation A = LU can be used to solve the system of equations Ax = b eﬃciently. If we set y := Ux, we have Ax = LUx = L(Ux) = Ly = b and, hence, can compute x in two steps:

(a) Forward elimination: solve Ly = b
(b) Backward elimination: solve Ux = y
Implement an algorithm ‘LUsolve’ that has the two matrices L and U produced by your factorisation method and a right-hand side b as arguments, and computes the solution x using forward and backward elimination as stated above. Compute the time complexity of ‘LUsolve’.

thanks!