$5.$ Considering the previous problem, suppose you were using Bisection Method to perform this search and an initial interval of $[$a$,$ b$]$ of length $1$ that contains the root. How many iterations of the Bisection Method would need to be performed in order to guarantee that $10-$decimal precision? How about $100$ decimals?

Final Answers: You would need $33$ iterations to guarantee $10$ digits of precision $($the $34$th interval you consider if the first is the one you start with$)$; for $100$ digits of precision you would need to iterate at least $332$ times $($the $333$rd interval you get$)$