Use matlab please! This is not a theoretical question. This is a programming question.

2. (Programming) For the following functions if x > 0 f(x) = with the root x* = 0, answer the following questions. (a) Apply Newton's method to f(x) function. What is the behavior of the iterates? Do they converge, (b) Do the same as in (a), but with g(x) and if so, at what rate? (c) Use the bisection method to find the root of f(x) = 0 with atol = 1e-6. How many iterations does it take to converge? What is the absolute error at the last iterate? d) Do the same as in (c), but with g(x)