Let us consider a Min$-$Max heap with N elements. The root node is at

level $0.$ We assume that the Min$-$Max heap is represented by a linear

array. We also assume that there are no duplicates in the heap.

Select one or more:

a$.$ For any element in array position i$,$ representing a node at

an odd level, the element at position i$/2($integer value$)$ is

always larger

b$.$ For any element in array position i$,$ representing a node at

an odd level, the element at position i$/2($integer value$)$ is

always smaller

c$.$ The largestelement is always the root right chatid:

d$.$ The largest element is one of the root: children

e$.$ Forany elementinarray position ferpresenting inode at

an even tevel, the elementat position $2$ in if any if ilways

smaller

For any element in array position tepresenting a node at

atways larger