Problem 1. (25pts) plement EACH of the the following 3 algorithms for solving equation Write a matlab function for to implement EACH of the the following 3 algo nethod; (iii) secant method; Use your codes to solve fr) = 0: (i) bisection method; (ii) Newton's method; (iii) secant method; Use your the following equation f(x) = cos(x) + 3-1 Requirements: (a): The stopping criterion for the iteration is EITHER the number of iterations reaches 50 OR the relative change of approximate solution is < 10-10, i.e., 2n+1 - Un <10-10 1+ lan (b): For each solution method, print out every step the floowing infomation: (i) current number of steps n; (ii) current approximate solution In; (iii) current function value f(n); (iv) current error err(n) = 2n - .; where s, is the roots found with fzero. (c): For each solution method, make a plot of the error history err(n) vs. n in log scale by using matlab command semilogy.