(nlogntime with probability at least / - given an array of entries with keys equal to or describe an in-place method for ordering so that all the ' are before every - suppose we are given an -element sequence such that each element in represents different vote for presidentwhere each vote is given as an integer representing particular candidate design an (nlogn)time algorithm to see who wins the election representsassuming the candidate with the most votes wins (even if there are (ncandidatesc- consider the voting problem from exercise - but now suppose that we know the number of candidates running describe an (nlogk)time algorithm for determining who wins the election - consider the voting problem from exercise - but now suppose candidate wins only if he or she gets majority of the votes cast design and analyze fast algorithm for determining the winner if there is one - show that any comparison-based sorting algorithm can be made to be stable without affecting its asymptotic running time - suppose we are given two sequences and of elementspossibly containing duplicateson which total order relation is defined describe an efficient algorithm for determining if and contain the same set of elements what is the running time of this methodc- given an array of integers in the range [ , ]describe simple method for sorting in (ntime - let , ,sk be different sequences whose elements have integer keys in the range [ , ]for some parameter > describe an algorithm running in