4. Use the master theorem to solve each of the following recurrences: (a) A(n) = 4A(n/3) + (vn) (b) B(n) = 2B(3/4) + (n) (c) C(n) = 3B(n/3) + (n) Next, choose one of the above recurrences, draw three layers of the corresponding recursion tree (the root, its children, and its grandchildren), and solve the recurrence by looking at the resulting geometric series