The maximum absolute error of bisection iterations can be given as:

$lo{n}_{\frac{?}{abs}}^{\text{m}\text{a}\text{x}}(k)=l{2}^{-k}$

where $k$ is the number of iterations and $l$ is the initial absolute distance between the upper and lower bounds. Determine how many iterations are required to reach the maximum absolute error level of $2^{-6}$ with initial bounds $x_a=0$ and $x_u=4.$

$($a$)8$

b$)10$

c$)12$

d$)14$