a) Prove the correctness of this algorithm using mathematical induction, considering that it will calculate the value log2(n). For the demonstration you will be able to consider that it is not even.

b) Write the recurrence equation and demonstrate the complexity of this algorithm. You must use induction or recursion tree demonstration.

LOGFLOOR(n) 1: if n == 1 then 2: return 0 3: return 1+ LogFloor([2])