This is data structure. Please use C++. Show me steps, please I need to review!!!

ID: 1. [10 points] Multiple Choices: circle the answer that best answers the question. 1.1. Which of the following (a) nt s grows fastest? nlogn (d) n (e) There is a tie among two or more functions for fastest growth rate 1.2. Suppose T1(n) O(F(n)) and T2(n) O(F(n)). Which of the following are true? (a) T1(n) + T2(n) = 0(F(n)) c) T1 (n)/T2(n) = 0(1) (e) none of the above 1.3. If logn equals 100, what is the value of log(2n)? * T2(n) = 0(F(n)) n) = 0(T2(n)) (a) 101 (b) 200 (c) 1000 (d) 10000 (e) none of the above 1.4. An algorithm takes 30 seconds for an input of size 1000. If the algorithm is quadratic, how large a problem can be solved in two minutes? 30 (a) 2000 (b) 4000 (c) 6000 (d) 60000 (e) none of the above