MATLAB CODE

Problem 1: Root of a Quadratic Function Consider the quadratic function f(x)=(x3)(x+1). This function has two known roots, x1=3 and x2=1. Please answer the following: (a) Use the bisection method to approximate the root x1=3. Use initial brackets [2,3.1] and a tolerance of 103. Store the value of the calculated root and the number of iterations required in variables called x1 a and nIters_a, respectively. (b) Repeat part (a) using initial brackets [1,5]. Store the value of the calculated root and the number of iterations required in variables called x1_b and nIters_b, respectively. Note: The number of iterations required for part (b) should be significantly less than part (a), despite using a larger bracket interval. Why is this? (No need to type an answer; just something to think about.)