Lab $6-2$ Instructions:

Write a program using recursion that first checks if there is necessarily any root in a given interval, and if yes then find a root. The function $f(x)$ must be evaluated in a separate $C$ function. The endpoints a and $b$ should be taken from the user.

If no root is guaranteed, print as such and exit the program. If and when root is found, print the root as well as the iterations$/$ recursive calls taken to find the root.

Output screen capture submission with one case as below: $f(x)=x^3-\mathrm{.}8x^2+\mathrm{.}09x+\mathrm{.}018$ in interval $[-1,1]$

And second case either of your choice or same $f(x)$ in $[0\mathrm{.}5,5]$