1. Suppose you have an array S of size n, where each element in S represents a different vote for class president, where each vote is given as an integer representing the student ID of the candidate. Without making any assumptions about who is running or how many candidates there are, design an O(n lg n) algorithm to determine which candidate receives the most votes. [10 points] 2. Consider a modification to the previous problem to a situation where we know the number k < n of candidates running. Design an O(n lg k) algorithm to determine which candidate receives the most votes. [10 points] 3. Given the input of the first problem, give an O(n) time algorithm to determine if some candidate received a majority ([]) of the votes. O(n) average or expected time is OK so the hint is to look for the median [10 points] 4. Given a list of n integers, describe how to find the n smallest items, listed in increasing order, in O(n) time. The input list is unsorted, but the output should be sorted. (Hint: n lg n and nlgn are both O(n).) [10 points]