. A binary min heap can be stored as an array. Consider the following example: 6 9) (8 0 1 2 3 4 5 6 values: 1 3 6 59 8 Note that- 1. 0th position of the array is left empty. 2. Left child of A[ i] can be found at A[ 2"i 3. Right child of A[ i] can be found at Al 2'1+1 4. The parent of A[ i ] is at Ali/21 Consider the the following array of length 6. Elements from the array are added, in the given order, to a min heap. The heap is initially empty and stored as an array. A = {12, 14, 5, 7, 15, 6} What will be the output array (heap)? index 0 2 3 4 values