The recurrence equation is T(n)= 2T(n/2) - n then the master theorem case is Select one: a. case 3 O b. Not applicable O c. case 1 O d. case 2 The recurrence relation T(n) = T(n-1) + n2 +logn then the time is Select one: O a. Not applicable O b. On logn) O c. On logn) d. Onh) The space complexity of the TSP is O a. O(n) O b. 0(2") O c. On Logn) 0 d. On!) The best case of nave algorithm that finds the all occurrences of a pattern is Select one: O a. O(n/m) O b. O(n) c. O(m) O d. O(nm)