1) The order in which we add information to a collection has no effect on when we can retrieve it.

true or false

2) If N represents the number of elements in the collection, then the contains method of the SortedArrayCollection class is O(N).

true or false

3)The add method of the UnsortedArrayCollection class takes O(1) time because it does not need to shift any elements

true or false

4) the add method of the SortedArrayCollection class takes O(N) time because searching in the array takes O(N) time.

true or false

5) The remove method of the LinkedCollection class takes O(N) time because it needs to shift elements after the remove operation.

true or false

6) There are no null references in a non-empty circular linked list.

true of false

7) For an unsorted singly linked list with a head and tail references, which of the following operations can be implemented in constant time? Choose the most comprehensive option. (1) Insertion at the front of the linked list (2) Insertion at the end of the linked list (3) Remove the front node of the linked list (4) Remove the last node of the linked list

which of the following is true.

8) The regular queue is a FIFO structure, meaning that you can only enqueue at the rear and dequeue at the front. Suppose that the dequeue operation can also be performed at the rear (so you can remove and return the last element on the queue), describe how you can use a linked list to implement this queue in an efficient way.