This is a continuation from the previous problem. Once you have found the lower and upper bound $($a and b values$)$ that brackets a zero$/$root for the Bessel function J$.$ You can now use the bisection method to find the zero$/$root$.$

Given the lower and the upper bound that brackets the root, write a function that outputs the root and the number of iteration using the bisection method. The function should accept the following inputs in order:

alpha $($alpha$)$ for Bessel function J

lower bound $($low$)$

upper bound $($upp$)$

And outputs the following in order:

root

number of iteration to reach approximate error $($present besselj of mid $-$ previous besselj of mid$)$ of $($Note: For example, input $=(0,2,3),$ the answer should be $2\mathrm{.}25$ for $1$ iteration$)$

For example:

To find the first root of J$0,$ your input for lower bound is $2$ and upper bound is $3.$

Input $=(0,2,3)$ Output $=[2\mathrm{.}4048255576957732]$

For supplemental deliverables, you do not need to run your code in Matlab Grader. You have to turn in a hard copy of what is asked.

Use your functions from problem $3\mathrm{.}2$ and $3\mathrm{.}3.$ Recreate the following table.