Question 3. (25 points) Given n distinct integers y1,,yn (not in sorted order), we want to find an integer y that minimizes the following quantity: i=1nyyi where yyi denotes the absolute value of yyi. Give an O(n) time algorithm for finding such a y, and prove the correctness of your algorithm