Quiz-1 This Question is based on the following topic and there are no negative marks, the are total 10 Question for 5 marks Analyzing Algorithms Theoretical Foundation Algorithms and its Specification Random Access Machine Model Counting Primitive Operations The notion of best case, average case and worst case Characterizing Run Time Use of asymptotic notation Big-Oh Notation, Little-Oh, Omega and Theta Notations Analyzing Recursive Algorithms Recurrence relations Master's Theorem Question 1 0.5 / 0.5 pts The concept of order (Big O) is important because [hint: This is a multi answer question] It is the lower bound of the growth rate of the algorithm It can be used to decide the best algorithm that solves a given problem It determines the maximum size of a problem that can be solved in a given system, in a given amount of time None of them Question 2 0.5 / 0.5 pts Deducing time complexity using master’s theorem T(n) = 3T(n/4) +nlogn θ(nlogn)