| c. 2 Q2. Disregarding any references or pointers in data elements, i.e., the info components, how many null pointers are there in a properly maintained, doubly linked list that is not empty? Q3. Which methods in our initial array-based implementation of the project #2 ListInterface needed to be changed in order to have a sorted list ADT? Select all that apply. As a reminder, the initial implementation included a remove( ) operation/method that replaced the item to be removed with the last item on the list, and then set the array position where the last item had been to null. | e. add( ) Q4. Check which items listed below, if any, are required in order to perform a Binary Search: | a.items to be searched must be arranged in a Binary Search Tree | | b.items to be searched must be sorted | | c. there must be at least 25 items to be searched Q5. What is the Big-O notation that indicates the time complexity for a binary search of N items? | | |