A complete tree is stored in an array with index 0 being unu…

A complete tree is stored in an array with index 0 being unused and the root stored in index 1.   If an element in the tree has the index i, which are the correct references to the parent, the left child, and the right child?    parent [blank1] left child [blank2] right child [blank3]