Q1) Let the following problem. The input consists of n skiers with heights p1, p2, . . . , pn, and n skies with heights s1, s2, . . . , sn. The problem is to assign each skier a ski to minimize the average difference between the height of a skier and his/her ski. Give a greedy algorithm to solve this minimization problem. Give pseudocode and write its asymptotic running time. Prove that your algorithm is correct.