Question $2$

Consider the following algorithm:

$($a$)$ What is the purpose of lines $1-4?$

$($b$)$ What is the purpose of lines $9-10?$

$($c$)$ What is printed upon execution of MYSTERY$(12)?$

$($d$)$ Rewrite MYSTERY as a recursive program.

$($e$)$ What, in big$-$O notation, is the time complexity of MYSTERY$(n)?$

Hint: $1+\frac{1}{2}+\frac{1}{x}+$cdots$+\frac{1}{n}=O(log(n))$

$($f$)$ What is the purpose of the program as a whole?