4.(20%) Given an array-based binary heap where each node has a key smaller than or equal to any children. Suppose that the following keys are added in order to this empty min-heap:
b. If a removal-of-minimum operation is performed, what is the new content of the array?