IN MATLAB

Write a function forward.m to solve n n lower triangular systems and a function backward.m to solve n n upper triangular systems. Then write a function mySolve.m to solve n n systems (under the assumption that elimination can be performed without row exchanges). Use MYLU.m from last weeks assignment. Test your code on Ax = b with A = [1 5 4 9 5; 3 0 4 1 0; 8 3 9 3 2; 8 8 6 9 5; 4 7 4 0 3], b = [44; 3; 42; 24; 15] . Check to see if your answer is correct. In your test.m, compare your mySolve solution with the internal MatLab solver linsolve(A,b).

I need help creating forward.m, backward.m, and mysolve.m, thanks!

MYLU is just another lucky decomposition we did last week. I'm pretty sure we're just using it to check if the forward and backward substitutions are correct