Question 2 (Recurrence Relations) [20 Pointsl For each of the following recurrences, derive its Big O complexity. For 3) & 5) below use the Tree- Based method (Section 4.4 in the Textbook), while for 1), 2) & 4) use the Master Theorem (Section 1 T(n) T(n/2)+O(1) **Also mention an algorithm we took in class or HW1 that closely follow this recurrence. 2) T(n)-2T(n/2) + n ** Also mention an algorithm we took in class or HW1 that closely follow this recurrence. 3) T(n) -4T(n/2) + n 4) T(n)-7T(n/2)+n2 5) T(n) T(n/3) + Log, n