I don&#x27;t understand this bit:<p>&gt; Now each of these arrays we organize as a max heap. Moreover, we arrange data such that the maximums of these heaps are in INCREASING order. That means the smallest element of the entire (initial) array is at the first position, then followed by the next 4 smallest organized in a max heap,<p>Just because the maximums of the heaps are increasing order doesn&#x27;t mean that the minimum is at the front. It means the first element is <i>smaller</i> than the <i>biggest</i> element of the next four.<p>Consider, for example:<p><pre><code>    1 4 3 2 0
</code></pre>
1 &lt; 4, certainly, but 1 &gt; 0. What am I missing?