how do u do this

A min-heap is stored in the following array: 0 1 2. 3 4. never 1 2 3 9 used 5 6 6 7 8 8 9 10 11 Suppose the following four operations are performed one after the other: insert(1); removeMin(); insert(3), removeMin(); Below, provide the heap's array state after each of these four operations. The result of each operation is the input for the next one. E.g. Operation 1: "X 1 2 3 4 5 6 7 8 Operation 2: "X 5 6 71234