QUESTION 2 The complexity of removing an element from unsorted array is O(1). True False QUESTION 3 The complexity of linear search will be 0(1) if the elements we search for is in the middle. O True False QUESTION 4 The complexity of removing the element before the last one in a singly linked list is O(n) O True False QUESTION 5 With binary search, the best case will be when the element we are looking for is in the first location index 0) True O False QUESTION 6 Generally, doubly linked list takes more space (memory) than singly list. O True O False QUESTION 7 To use linear search, the array must be sorted. O True O False