not just answer, need explain thanks

A binary max heap can be stored as an array. Consider the following example- 18 13 25 Array representation of the heap Index Value 80 18 40 13 25 Note that 1. Note Oth position is left blank 2. Left child of A[ i] can be found at A 2i 3. Right child of A i] can be found at A 2i+ 1]. 4. The parent of Al i is at Ai/2]. Consider the the following array of length 6. Elements from the array are added, in the given order, to a max heap. The heap is initially empty and stored as an array A (40, 12, 46, 1, 2, 50 What will be the output array (heap)? index 0 values Check