matlab coding

input(function, initial range, number of subranges to divide initial range into) Output (umber of roots found, a vector of lower limits, a rector of upper limits) For example, if the initial range is from 0 to 10, and 10 divisions are used the algorithm will look in the subranges: 0-1, 1-2, 23, -- 9-10. If a root exists in 3 divisions, say divisions 24,8, then the algorithms number 3, and the away of sub-range limits 2) False position method to identify a single root is a pive range input(function, initial range, error tolerance) output - (root location, ettor in final estimate number of iterations required to find estimate) 3) Newton Raphson method to identify a single root pires an initial condition imput - (function, derivative function initial gues, error tolerance) output-root location, error in final estimate, number of iterations required to find estimate) Assignment Part 1: For each of the two function below 1) Use the modified incremental search to identify the number of root, and their subranges. Play around with the of songs for each equation to see how it affects the performance of the two methods. For the finalinio se ubranges for equation, and 15 subranges for equation W2 2) Set up a loop in the main program to call false position for each root identified in 1). Give the new subrange to look into each time through the loop, and save all function outputs into vectors 3) Set up a loop is the main program to call Newton Raphson for each root identified in 1) Give the ton md of onge as the initial, and save all function outputs in vectors. Use an error tolerance of 001 for parts 2&3 for the final output, but play around with tolerance first to see how it affects EQ 4:1 + 3x -ar: + 0.04x" for -2 51