Heaps - General Questions

In a max-heap, every parent is:

For a heap stored in an array with 0-based indexing, the parent of the node at index 9 is at index:

Inserting into a binary heap takes:

What is the output of the following code?

import heapq
h = []
for x in [5, 1, 8, 3, 2]:
    heapq.heappush(h, x)
print([heapq.heappop(h) for _ in range(3)])

Inserting 5, 3, 8, 1 one by one into an empty min-heap (array form) gives: