algorithms analysis and design

The brute force (BF) of polynomial evaluation time is no O a. O(n) O b. O(n) O c. O(Log n) O d. O(1) The time complexity of TSP is O a. O in 0 b. Onlogn) O c. 0(2) 0 d. On!) if the time of an algorithm represented by the recurrence T(n) = 2T(n-1) + n , then the time of this algorithm is polynomial time Select one: O True O False