Consider the node of a complete binary tree whose value is stored in tree$[$i$]$ for an array implementation in which the first index is $1.$ If this node has a right child, where will the right child's value be stored?

tree $2^{**}i+2$

tree$[2**i]$

none of the listed

tree $2**i+1$