(python)Suppose we are given an n-element sequence S such that each element in S represents a different vote for president, where each vote is given as an integer representing a particular candidate.

1. Design an O(n lg n)-time algorithm to see who wins the election S represents, assuming the candidate with the most vote wins - even if there are O(n) candidates.

2. Consider the voting problem from above, but now suppose the number of candidates are a small constant number. Describe an O(n)-time algorithm for determining who wins the election.