Brief explaination for each solution thank you!

Problem 2: Today in class we saw that comparison-based sorting algorithms must always make (n log n) comparisons to sort an array of n elements. Prove that any comparison-based algorithm must make (n) comparisons to find the median of an array of n elements Hint: One possible way to solve this problem is to assume that there is an algorithm that finds the median with o(n) comparisons and derive a contradiction. Problem 3: You are running an election. There are k candidates running for office and each candidate is associated with an integer between 1 and k. There are n votes (you can assume that k <>