Consider a root solving algorithm of order $2$ with asymptotic error constant $0\mathrm{.}6.$ If your initial error $E_o$ is about $0\mathrm{.}6,$ then the error $E_3$ in iteration $3$ is about: Assume there are no round$-$off errors when applying this algorithm

a$.4\mathrm{.}7e-4$

b$.1\mathrm{.}0e-4$

c$.0\mathrm{.}0060$

d$.$ None of these

e$.0\mathrm{.}0036$