Code using python. Only need Q3

2) Let f(x) = x**5 + 52*x**3 - 29 be a function. This function has only one root in the real numbers. Write a bisection search algorithm to find that root up to two digits of accuracy, i.e., for epsilon = 0.01 as in the class. 3) Solve question 2 using the Newton-Raphson method. Compare the number of iterations with the bisection search