help

Consider the heap that is represented by the following array. Show the contents of the array after three passes of the heapsort algorithm. After three passes the three largest numbers should be in their sorted positions and the remainder of the array should hold a valid, smaller heap