jsut answer plz.

QUESTION 1 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. True False QUESTION 2 An array allows for more flexible memory management than linked structure. An array does not require large contiguous memory blocks. True False QUESTION 3 A linked structure, as compared to an array, does not require fixed size of memory space. True False QUESTION 4 The tightest upper bound for T(N) = 10002 - 1000 is O(N2). True O False QUESTION 5 The tightest upper bound for T(N)=NlogN+ N2 + 1000 is O(NlogN). True False QUESTION 6 Given two algorithms with growth rate functions fN) = 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). O 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 False QUESTION 10 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). True False