data structures

QUESTION 11 0.25 p The fewest/smallest number of basic operations carried out by the algorithm for a given input is called A Best Case Complexity B. Worst Case Complexity OC Average Case Complexity OD None of the above QUESTION 12 0.25 points The most commonly used notation for specifying asymptotic complexity is the O A Big-O notation OB Theta notation C Omega notation OD Alpha notation 0,25 points Sarv QUESTION 13 QUESTION 13 Which of the following cases gives the largest number of basic operations carried out by the algorithm for a given input. O A Poor case OB. Worst case C Best case OD Average case QUESTION 14 0.25 The Big O notation of time complexity T(m)=(2000 13 - 2n! + Ion - In log n+5) will be A on log n) OB 0m) con On! QUESTION 0.25 points