Consider a root solving algorithm of order $4$ with asymptotic error constant $0\mathrm{.}3.$

If your initial error $E_o$ is about $0\mathrm{.}9,$ then the error $E_3$ in iteration $3$ is about:

Assume there are no round$-$off errors when applying this algorithm

a$.1\mathrm{.}2e-14$

b$.6\mathrm{.}5e-12$

c$.2\mathrm{.}7e-18$

d$.$ None of these

e$.1\mathrm{.}9e-12$