Please explain how to get the answer with steps

Assume the following list of keys: 7, 28, 31, 5, 40, 20, 88 with large key has higher priority. Show the resulting heap structure and list after it is heapified. In list form after heapify: 88 40 31 5 28 20 7 Continue previous heap problem, show the resulting structure and list after the largest key is deleted. After largest key is deleted and re-heapified: 40 28 31 57 20