How is a binary heap represented in memory starting with a blank value? For any node at index i$,$ its left child is stored at index $2$i and its right child is stored at index $2$i$+1,$ For any node at index i$,$ its left child is stored at index $2$i $-1$ and its right child is stored at index $2$i$,$

For any node at index i$,$ its left child is stored at index $2$i and its right child is stored at index $4$i$,$ or For any node at index i$,$ its left child is stored at index $2$i $+1$ and its right child is stored at index $2$i$+2$