4. (4 points) Using the given keys, draw a max-heap that satisfies the following condition: removing the maximum will involve the minimum possible number of key exchanges. keys: 10, 20, 30, 40, 50, 60, 70, 80