Suppose you implement a Min heap (with the smallest element on top) in an array. Consider the different arrays below; determine the one that cannot possibly be a heap:

(A) 16, 18, 20, 22, 24, 28, 30
(B) 16, 20, 18, 24, 22, 30, 28
(C) 16, 24, 18, 28, 30, 20, 22
(D) 16, 24, 20, 30, 28, 18, 22