Try this exercise. Fill in the missing part by typing it in.

When inserting an element into a min heap, the new element is placed at the next available position in the heap array. The heap property is then restored by comparing the new element with its parent and swapping them if necessary until the heap property is satisfied. This process is called ____.