Use the master theorem to find an asymptotic upper bound for the following recurrence. Justify your answer. You can assume that t(1) = 1. t(n) = t(n/2) + t(n/3) + n³
a) O(n)
b) O(n²)
c) O(n³)
d) O(nlogn)