Use a recursion tree to determine a good asymptotic upper bound on the recurrenceT(n)=3T(⌊n/2⌋). Use mathematical induction to prove your answer.
a)O(n)
b) O(nlogn)
c)O(n2)
d)O(2n)