please complete in MATLAB asap using Fixed-point iteration method. Please show code

2.1 Implement the bisection method, fixed-point iteration, and Newton's method. Compare these for the following tasks: a) Find the first two positive roots of f(x)=cos(x). b) Find both roots of f(x)=(x1)3(x+2). You can compare the methods by (a) the number of iterations required to find the roots to some target accuracy and also (b) by the difficulty of choosing starting points or intervals that give convergence. Note that Sauer provides code for bisection and fixed point iteration (Program 1.1 and Program 1.2). You can use these, or write your own code, or use other code. Checklist Did you search for the roots using the required methods? Did you show the results for each method? Did you explain how you did it? Did you compare the methods? Did you discuss any difficulties? Did you discuss adjusting fixed-point iteration when needed? Did you discuss any unusual results? Did you include code where appropriate? Did you reference the source of any code you didn't write