QUIZ # 1: 425 (Theory of Algorithms) Date: 2/3/2020 30 Points. 1. Short Questions: a) What are the three steps of a Divide and Conquer Algorithm (Just name, no need to describe) b) Define what do you understand by runtime of an Algorithm? c) Given a set of 100 unsorted data (e. N-1001. What would be the runtime If Selection sort is used to sort them? d) Explain the primary differences between an iterative and a Recursive Algorithm? e) What are the two major steps of a Recursive algorithm? 2. Given a function as below: int Rate (int N) if (N == 0) return 2; else return N.Rate(N/5) a) What type of function is this? Recursive/Iterative. Give justification