Consider the following algorithm which receives as input two numbers $$ and $$ and sets

$$ to $\backslash$times $$; div is the integer division operator.

$0$

repeat

if $$ is odd then

$+$

$$ div $2$

$+$

until $<1$:

$$ State $($as a function of $$ and $)$ how many times the loop is executed and justify your

answer.

$$ Give the running time of the algorithm in $\backslash$Theta notation as a function of $$ and $.$ Explain

how you reached the answer.