Find the root of f(x) = x³ + 4x² - 10 using the bisection method with the following specifications: a.) Modify the Python for the bisection method so that the only stopping criterion is whether f(p) = 0 (remove the other criterion from the code). Also, add a print statement to the code, so that every time a new p is computed, Python prints the value of p and the iteration number. b.) Find the number of iterations N necessary to obtain an accuracy of 104 for the root, using the theoretical results of Section 2.2. (The function f(x) has one real root in (1, 2), so set a = 1, b = 2.) Solution: We have, Nz log(b-a)-loge log2 Here we have € = 10-4, a = 1, b = 2 and n is the number of iterations log(1)-log (10-¹) N2 log2 13.28771238 Therefore, N = 14. c.) Run the code using the value for N obtained in part (b) to compute p₁, P2,...,PN (set a = 1, b = 2 in the modified Python code).