Use recursion trees to solve each of the following recurrences. Each tree should show levels
0, 1, 2, and 𝑖, as we did in class. From that tree, derive the asymptotic running time
(e.g., 𝑂(𝑛) or 𝑂(𝑛 lg 𝑛)). Assume that 𝑇(0) = 𝑇(1) = 1 for each recurrence.
a) 𝑇(𝑛) = 2𝑇(𝑛/4) + 𝑛
b) 𝑇(𝑛) = 3𝑇(𝑛/3) + 𝑛
c) 𝑇(𝑛) = 4𝑇(𝑛/2) + √𝑛