PYTHON: I need to write a algorithm to solve a triangular system using a double loop method. Help on 4.1 and 4.2!

4.1)(10 pts) Program a backward solver (i.e. write your code) for an upper triangular system Ux = b. The algorithm is as follows: (b - EU. U' Vi= m, ..., 1, m X; = j=i+1 for i and j with offset 1. Recall that Numpy and Python have offset 0 for their sequence data types. ""'4.1) Code 1 2 4.2)(10 pts) Demonstrate your code is correct (do not compare against another solver) and provide an output example for U, b, and x (use at least 7 unknowns). 1 "'4.2) Test U x = b'" 2