4. It's election time! Let S[1n] be an array that contains the votes of n people in an election. The entry of S[i] is an integer that presents the ID of the candidate that voter i chose. We say that a candidate is the winner of the election if among all candidates, he/she received the most number of votes and no other person received the same number of votes. (a) (4 pts.) Without making any assumption about who is running or even how many candidates there are (i.e., you don't know the ID's of the candidates ahead of time ), design an O(nlogn)-time algorithm that outputs the winner of the election if one exists. (b) (6 pts) Consider the voting problem above, but now suppose that we know the number of candidates running is k and k<>