Do this problem last. (a) You are given $n$ arbitrarily ordered comparable keys (i.e. THEY ARE NOT SORTED). We want to determine the smallest and the second smallest in the smallest number of comparisons (NOT RUNNING TIME). Pick the best answer. (Assume keys are in array A[ 0. .n-1 ].)

(b) You are given $n$ arbitrarily ordered comparable keys (i.e. THEY ARE NOT SORTED) stored in array A[ 0 .. n-1 ]. We want to determine the $\lg{n}$ largest keys and print them in the output in sorted order (smallest of $\lg{n}$ on the left side of the output, largest of the $\lg{n})$ on the right side of the output. What is the comparison count of the best algorithm that solves this problem? If it helps you may assume that $\lg{n}$ is an integer i.e. that $n$ is a power of two.