Section A True or False Questions (10 questions, 2 marks each) In each of the following question, please specify if the statement is true or false. Enter your answer True or False in the following table. 10 2 4 An abstract data type is a high level description of the logical picture of the data and the operations that manipulate them, it is implementation independent. 1. A data structure is a particular way of organizing data in a computer, and it is how we implement the data in an abstract data type. 2. 3. Given two algorithms with growth rate functions f(N) (N+N)/3 and g(N) 100Nlog, N, the algorithm with growth rate g(N) grows faster than the algorithm with growth rate f (N). 4. The tightest upper bound for f(N)Nlog2N 10002 +N2 is O (Nlog2N). One advantage of an array, as compared to a linked structure, is that it can directly access to data in the middle of data structure by index operation. 5