i found this course is soo hard cant even understand through reading other guys' solution..

Q1: Problem Recurrences- (6 4 = 24 points) Give asymptotic upper and lower bounds for T(n) in each of the following recurrences. Assume that T(n) is constant for n s 10. Make your bounds as tight as possible, and justify your answers T(n)-2T(n/3) + n lg n 2 T (n) T(n/3) 2 3 T(n) = T(Vn) + (lg lg n) 4 T(n) = 7T(n/2) + 5 T(n) T(n -2)+lgn 6 T(n) = T(n/2) + T(4n/5) + (n) 1