For a node at position $k$ in an array representation of a binary heap $(1$ to $n$

indexing$),$ the left child is at

$2^{**}k+1$

$2^{**}k$

$2^{**}k+2$

$2^{**}k-1$