5) (4 points, 1 point each): Answer just TRUE or FALSE for each of the following statements You don't have to Prove or Disprove these statements, nor do you have to provide a solution. These questions reference the Master Theorem. Answer using the Master Theorem as it appears in CLRS Theorem 4.1 (page 94); it also appears at the bottom of Slide 19 in Lecture 13 a) You can solve the recurrence equation: using the Master Theorem You can solve the recurrence equation: using the Master Theorem You can solve the recurrence equation: using the Master Theorem You can solve the recurrence equation using the Master Theorem T(n) = T(n-l ) + 1/m2 b) T(n) T(n/2)+12 c) T(n) = T(n/2) / 4 + 12 d) T(n) = 2T(n/2) + n log n