Derive solutions to the following recurrences in two ways: draw a recursion tree and apply the Master Theorem. Assume T(1) = (1). (a) [5 points] T(n) = 2T ) + (2) (b) [5 points] T(n) = 316) + O(n) (c) [5 points] T(n) = 2T) + log, n +6 (d) [5 points] T(n) = VnT(n) + O(n) recursion tree. Assume T(2) = (1) and only draw a Derive solutions to the following recurrences in two ways: draw a recursion tree and apply the Master Theorem. Assume T(1) = (1). (a) [5 points] T(n) = 2T ) + (2) (b) [5 points] T(n) = 316) + O(n) (c) [5 points] T(n) = 2T) + log, n +6 (d) [5 points] T(n) = VnT(n) + O(n) recursion tree. Assume T(2) = (1) and only draw a