Problem
1. Describe an in-place version of the quick-select algorithm in pseudo-code.
2. Show that the worst-case running time of quick-select on an nelement sequence is (n2)
3. Given two sets A and B represented as sorted sequences, describe an efficient algorithm for computing A > B, which is the set of elements that are in A or B, but not in both.