if the time of an algorithm represented by the recurrence Tn) = 2T(n-1) + n, then the time of this algorithm is polynomial time Select one: True False Circular queue is a linear data structure Select one: O a. False Ob. True The time complexity for adding an item to the queue is O(1) Select one: a. True Ob. False The smallest size of n in the Strassen's method that has a solution is 1 Select one: O True O False The sort technique that hasn't a best case is O a. quick sort O b. merge sort o c bubble sort O d. insertion sort Windows The recurrence relation T(n) = T(n-1) + n +logn then the time is Select one: O a. Not applicable Ob. on logn) O c. Oin logn dn) Windows