needs coding the code: ( pages order is shown in the photos)

4. Use the code from the notebook presented in class that solves the problem 2u=(20y3+92(yy5))sin(3x) on the unit square [0,1][0,1] with homogeneous Dirichlet boundary conditions (i.e., u(x,y)=0 every where on the boundary). (a) See how large you can take m (the number of grid points in each direction) before the solution of the problem above gets very slow or runs out of memory (this will depend on the computer you're running on). What if you use the non-sparse version of A ? How large can you take m now before it becomes very slow or runs out of memory? Explain what is happening. It may be usefull to check the amount of RAM that your computer has. (b) Modify the code to solve the boundary value problem 2u=(22x2)cos(y) on the unit square 0