Max heap

Using the keys 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 and 12, draw a binary max heap that stores these keys in some legal heap order, and has the keys 3, 2 and 1 in left-to-right order in the last three positions (i.e., the rightmost 3 nodes at the bottom-most level), such that after 2 consecutive calls to deleteMax(), the bottom-most level consists of the keys 1, 2 and 3, in that left-to-right order.