Homework 3 an algorithm with T(n) = n then this algorithm is 0(n); TF? 1) a. Give n algorithm with T(n)-n2 then this algorithm is not necessarily 0(n); TP? b. Given a 2) Given the following recurrence: if n-I Select the correct answer: (and briefly explain why (a) T(n) = 0(n) (c)T(n) = (n) (d)T(n) = (n lg n). (e) T(n) e(n2 lg n). 3) Write down all the steps of the divide-and-conquer algorithm for finding maximum subarray sum for the following input array A of length 8: 2 -2 -1 7 2 3 2 1 4) Show that 3n+'+10 2()? 5) (FIB3 log a" b) 1/ logb a