Ex$\mathrm{.}7$ This is from a common coding interview question: Imagine you are given list of n integers $.$ Assume they are distinct if that helps you. Give an algorithm that finds the smallest and the second smallest element in the list, using at most logn comparisons, and explain why your algorithm needs at most n$+$logn comparisons $.($Hint: think again of the pairing process l$,$ when trying to find the max and the min simultaneously ; where is the second smallest element located? Here, thinking about tennis or chess tournaments may help you.