Please answer part 2

CS3343 Analysis of Algorithms Fall 2018 Homework 2 Due 9/10/18 before 11:59pm (Central Time) 1. Master theorem (6 points) Use the master theorem to find tight asymptotic bounds for the following recurrences. If the master theorem cannot be applied, state the reason and give an upper bound (big-Oh) which is as tight as you can justify. Justify your answers (by showing which casc of the master thcorem applics, and why (1) T(n) = 97(n/3)+Vn (2) T(n) -2T(n/2) +nlogn (3) T(n) 36T(n/6) +n2 (4) T(n)-T(2n/5)n (5) T(n)-T(2n/3) T(n/3) n (6) T(n)=T(n 2) + n 2. Recursive Program (5 points) Consider the following recursive function for n >0: Algorithm 1 int recFunc(int n) //Base Case if n