Determine the case, if any, of the Master Theorem that would apply to the recurrence: T(n) = 6 T((4n - 5)/5) + 8n - 2n - 8n - 3n+ 8, if indeed the Master Theorem is applicable. Select one: O a. Case 1 O b. Case 3 O c. Case 2 d. None, although Master Theorem is applicable O e. None, because Master Theorem is not applicable Counting only the basic operations {+, - *, 1, ==, , =, !=, or, and, car, cdr, cons}, determine the recurrence relation defining the time complexity, T(n), of the following function. def unknown(n): if n