Write an Octave function that implements adap$-$

tive Simpson's rule as a recursive function. Some notes

about the structure:

$[$A$]$

$($a$)$ The inputs to the function should be $f(x),a,b,$

and a maximum overall error, tol.

$($b$)$ The output of the function should be the esti$-$

mate and, if you are feeling particularly stirred,

the number of function evaluations. CAN YOU GIVE ME THE OCTAVE CODE OF THIS QUESTION?? THANKS