Please someone help me:

1. 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. Design an O(nlogn)-time algorithm to see who wins the election S represents, assuming the candidate with the most votes wins (even if there are O(n) candidates).

2. Consider the sequence of integers S= {6, 7, 5, 7, 1, 0, 1, 6, 2, 4}. For each of the following sorting algorithms, draw diagrams that trace the execution of the algorithm as it sorts the sequence S.

Merge-sort

Quick-sort