Build the function (log2 n) that takes a positive integer, n,
and computes the number of times n can be divided by 2 until
it reaches 1 or below.
Test Cases
(log2 1) -> 0
(log2 2) -> 1
(log2 4) -> 2
(log2 8) -> 3
(log2 10) -> 4
(log2 1e1000) -> 3322
a. Write (log2 n) that uses a recursive process.
b. Write (log2 n) that uses an iterative process.