 As required.Noting that the left child of any node is always 1 place before its right child, we get formula_32.If the root is located at index 1 instead of 0, the last node in each level is instead at index formula_19.