A binary min heap can be stored as an array. Consider the following example: 6 O 8 values 13 6 598|| index: o 1 2 3 4 5 values: Note that- 1. Oth 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 A[ 2*i+1]. 4. The parent of A[i] is at A[i/2). 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)