Consider a heap A[1:::n]. Prove that by lling its implicit binary tree from top to bottom, left to right order (rst all nodes in a layer, then their children) makes A[2j] as the left child and A[2j + 1] as the right child of A[j]. Note: Consider induction for both above proofs