QUESTION 6 N Given two algorithms with growth rate functions f(N) = 1000n2 and g(N) = N2 + N, the algorithm with growth rate f(n) grows faster than the algorithm with growth rate g(N). True False QUESTION 7 Binary search requires the elements in the array are sorted. The time complexity of binary search algorithm is O(logN). True False QUESTION 8 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. True False QUESTION 9 A data structure is a particular way of organizing data in a computer, and it is how we implement an abstract data type True O False QUESTION 10 2 When using singly linked structure to implement a list, the best possible time complexity of adding a new element in the list containing N elements is O(N). O True False