Yоu аre implementing the insert methоd fоr а Min-Heаp using an ArrayList as the underlying structure. The heap must maintain its "complete binary tree" property at all times. public void insert(E element) { // Step 1: Add the element to the structure heapArray.add(element); // Step 2: Restore the heap-order property upheap(heapArray.size() - 1); } Based on Step 1 of the code, where is the new element physically placed within the heap's logical tree structure before the upheap process begins?