Write a matlab m-file (called bisection.m) implementing the bisection method for solving f(x) := fun(x) = 0. Note that the bisection routine depends on n,a,b,fun where n is the desired number of steps (or iterations), a and b are the initial interval endpoints and fun is the function. These values are to be defined on the command line one at a time before the m-file is invoked (when you type bisection on the command line). Thus, you can make runs with different values for n,a,b, and fun by redefining them on the command line and re-invoking the 1 2 m-file. Note that you must be executing matlab in the directory where you created the bisection.m file. From the plot of P(x), we see that the intervals [-2,-1], [-1,0], [0,.4], [.4,1] bracket the four roots. Run the bisection method over these intervals to obtain approximations to the four roots. Report the results of your iteration (an + bn)/2 for n = 20 for each interval. Now make the same runs but with n = 30. This will give you a rough idea about the accuracy, i.e., it is approximately the error between the results for n = 20 and n = 30.