A ski rental agency has n pairs of skis, where the height of the the ipair of skis is s; . There are n skiers who wish to rent skis, where the height of the ith skier is. h;. Ideally, each skier...

Extracted text: A ski rental agency has n pairs of skis, where the height of the the ipair of skis is s; . There are n skiers who wish to rent skis, where the height of the ith skier is. h;. Ideally, each skier should obtain a pair of skis whose height matches her/his own height as closely as possible. We would like to assign skis to skiers so that the sum of the absolute differences of the heights of each skier and her/his skis is minimized. Design a greedy algorithm for the problem. Prove the correctness of your algorithm. (Hint: Start with two skis and two skiers. How would you match them? Continue to three skis and three skiers, and identify a strategy.)