Please show your work. Thx.
1. You are a choreographer putting together a dance number where the dancers will dance in pairs. Each danceri has a height hi and you can only pair up dancers if the difference between their heights is at most H. You wish, given this constraint, to find the maximal number of suitable pairs. Describe and analyze a greedy strategy for this problem. (5 points, strategy description;9 points, correctness proof 3
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured