Write a MATLAB code to find the root for the following equation using the modified false position f(x)-x10-1 Your initial guesses should be 0 and 1.5. Approximation error( )should be less than 10-5 Your coding should start with the false position methood However, every 3 iterations, your coding should compare both the new xu and new xl with the xu and xl from 3 iterations ago, respectively, to detect if you are stuck. For instance, compare the 4th iteration to the 1t iteration. But do not write your code comparing just the 4th iteration to the 1st iteration, write a code that can generally detect such slow convergence at any time during the calculation If either xu or xl does not change, have you algorithm switch the method to the bisection method to get you to convergence faster Explain your code with %, be as elaborative as possible, no points if don't understand your coding, even if you have the right answer Your code should display the following results: the iteration number and corresponding xl and xu for each iterations, the root and total number of iterations used Comment on how many roots are there for this equation? You do not need to find the other roots if there are more xnew-xold . .I have made a mistake on one of the code I uploaded, if you used any part of my code in yours, please double check it