Assuming natural comparison order, show in the following table the results after inserting the elements into an initially empty min-heap which is implemented with a python list. The elements to be entered are 59, 51, 71, 10, 69, 76, and 96 one at a time and in this order. For your checking, the first and the last answers have been provided.