Right answer is (b) A[Parent(i)] <= A[i]
Best explanation: The min heap is also known as ascending heap. Min heap of size n is an almost complete binary tree of n nodes such that the element at each node is greater than or equal to the element at its parent node.