1 Given an unsorted list of n values, what is the time-complexity to _nd the kth smallest value in the worst case? What would be the complexity if the list were sorted? 2 What is the O(_) for the...

1 Given an unsorted list of n values, what is the time-complexity to _nd the kth smallest value in the worst case? What would be the complexity if the list were sorted?

2 What is the O(_) for the findSortedPosition() function in the worst case?

3 Consider the new implementation of the Set class using a sorted list with the binary search.

(a) Prove or show the worst case time for the add() method is O(n).

(b) What is the best case time for the add() method?