In MATLAB, can you do one function code followed by a driver code: Write a script that for a function $f,an$ interval $[a,b],$ and a minimum distance between

possible roots, implements the strategy above. For the root finding technique, use the

bisection method. Once each root $is$ found, the program should print $it$ along with $a$

message and then continue $to$ scan the interval.

$b.$ Test your code $on$ the function $f(x)=x+cos(10x)$ between $x=0$ and $x=1.$

Experiment with the minimum distance between roots until you are confident that you

have found all the roots.$b.$ Test your code $on$ the function $f(x)=x+cos(10x)$ between $x=0$ and $x=1.$