Consider the following Euclid's algorithm for finding the Greatest Common Divisor for two non$-$negative integers.

ALGORITHM Secret$(m,n)$

while $n0do$

rlarrm mod $n$

mlarrn

nlarrr

return $m$

How many iterations does it require to solve Secret$(4,8)$ using the above algorithm

A$.1$

B$.2$

C$.3$

D$.4$