(9) Consider the following recursively defined function on positive integers: (1) = 0 L(r) = 1 + L( ) (where L2] is the floor function -- i.e., it drops off any fractional portion of the parameter to evaluate to the corresponding integer. For example, [2.7] 2) Prove that L(n) s log,(n) for all n 2 1