A binary min heap can be stored as an array. Consider the following example:

Note that-

0th position of the array is left empty.

Left child of A[ i ] can be found at A[ 2*i ].

Right child of A[ i ] can be found at A[ 2*i + 1 ].

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)?

index	0	1	2	3	4	5	6
values		Answer 0	Answer 1	Answer 2	Answer 3	Answer 4	Answer 5