answer only

QUESTION 11 A doubly linked list can guarantee that adding new elements to the front and back of list are all 0(1). True False N QUESTION 12 The time complexity of finding the maximum value from a linked list with N elements is O(N). True False QUESTION 13 A stack is a list of elements in which insertion and deletion are performed at the different positions of the list. True False QUESTION 14 In both array and linked structure implementations of stack, the best possible time complexity of pushing a new element in a stack containing N elements is O(N). True False QUESTION 15 The array implementation of queue, i.e. circular queue, has no fixed capacity. O True False N QUESTION 16 What is the time complexity (Big-Oh) of T(N) = 10 NlogN+ 100N + 1000? O(1) O(N) O(NlogN) ON2) QUESTION 17 What is the time complexity (Big-Oh) of the following code fragment in terms of the variable N? int sum = 0; for (int i = 0; i