1) Indirection, as talked about in lecture, means you have to traverse the list more than once.

True

False

2) The complexity of binary search on a sorted list of n items is O(log⁡n).

True

False

3) The worst case time complexity for selection sort is O(n ² ).

True

False

4) The base case for the recursive version of merge sort from lecture is checking ONLY for the list being empty.

True

False