please quick

estion 1 - Order of Growth Determine whether the following statements are true or false (circle T or F). (10 pts) Statement True False 1. n(n+1)/2 0(n) TF 2. n(n+1)/2 (n3) T F 3. n(n + 1)/2 + 2(n) TF 4. 2n+1 e 0(21) TF TF 5. 221 0(2) For each of the following functions indicate the class (g(n)) the function belongs to. Explain. (6 pts) 1. (n2 + 1910 e ) 2. mn+1 + 3n-1 el ) 0 ) 3. n3/1000 100m2 100n +3 Use the master method to give tight asymptotic bounds for the following recurrences. Show your work. (6 pts) 1. T(n) = 2T (3/4) + 1 2. T(n) = 4T (n/2) +n 3. T(n) = 2T (n/4) + Vn