Please help me solve this thoroughly!!

Thank you. I really appreciate your help.

Develop your own M-file for bisection in a similar fashion to the textbook file bisection.m. However, rather than using the maximum iterations and the approximate relative error lEal, employ the equation that calculates the number of iterations n needed for a specified total error E iterations (Hint: the ceil function provides a handy way to do this) 'adesired. Make sure to round the result up to the next highest integer number of o The first line of your function should be: function [root, Ea, ea, n] Hw1_1_lastnamefirstinitial (func, xL, xU, Ead, varargin) root = value of x at root, Ea = approximate absolute error, ea = approximate percent relative error, n = number of iterations, func = function, XL = lower bound, xU- upper bound, Ead desired maximum error . o Set up the function so that it uses a default value for Ead = 0.000001 o You are welcome to modify the bisection.m M-file to develop your solution o What to turn in: Test your M-file using the example problem from class in Handout 2, slide 11 Take a screenshot of your function call and output, and paste it into your main homework file Submit the M-file along with your main homework file directly to Canvas *