Consider a node $R$ of a complete binary tree whose value is stored in position $i$ of an array representation for the tree. If $R$ has a right child, where will the right child's position be in the array?

$2**i+1$

$2**i+2$

$i+1$

None of the above