In a binary min heap where the minimum element is at the root, what is the condition for the parent node at index $\text{'}$i$\text{'}$ and its children?

The parent node is less than or equal to both of its children.

There is no specific relationship between the parent node and its children in a binary max heap.

The parent node is greater than or equal to its left child and less than or equal to its right child.

The parent node is less than or equal to its left child and greater than or equal to its right child.

The parent node is greater than or equal to both of its children.