If the root of a complete tree starts at index 1 and given the index i of a node, prove mathematically that the formulas used in the following functions are correct and they will return the indices of that nodes parent, left child, and right child.

Parent(i) return i / 2

Left(i) return 2 * i

Right(i) return 2 * i + 1