A group of n tourists with heights hi go to a rental place with n surfboards, each of length lj . Give an algorithm that will assign each tourist i their own surfboard a(i) such that the total size difference between tourists and their boards Pn i=1 |hi la(i) | is minimized.