Exercise 4.3. Solve the following recurrences. Give the answer in terms of Big-Theta notation. Solve up to constant factors, i.e, your answer musit give the correct function for T(n), up to constant factors. You can assume constant base cases, i.e., T(1) = T(0) c, unere c is a positie constant. You can ignore floors and ceilings. You can use the DC recurrence theorem if it applies. i) T(n) = 4T(n/3) + n2. j) T(n) = T(3n/4) + T(n/4) + n. l) T(n) = T(3n/4) + 0(n)