The time complexity of poping item from the stack is Select one: O a. Oflogn) O b. O(n) O co(1) O d. None of these If there are 2 algorithms F1(n) =n/10 and F2(n)=100n? then we can say Select one: O a. F2 has always less time O b. F1 has always less time for large input O C. F2 has always less time for large input O d. F1 has always less time Windows ban The recurrence relation T(n)= 3T(1/2) + logn then the case of master theorem is Select one: o a. Case 3 O b. Not applicable oc. Case 2 d. Case 1 Boyer-Moore string matching algorithm has a best case when pattern is not exist Select one: O True O False If algortithm1 takes sqrt(n) time and algorithm2 takes log(n) then Select one: O a. algorithm1 is better for small n O b. algorithm2 is better O c. we can't decide d. algorithm is better