Consider an ordinary binary min-heap data structure with n elements that supports the instructions INSERT and EXTRACT-MIN

Question:

Consider an ordinary binary min-heap data structure with n elements that supports the instructions INSERT and EXTRACT-MIN in O (lg n) worst-case time. Give a potential function Φ such that the amortized cost of INSERT is O (lg n) and the amortized cost of EXTRACT-MIN is O (1), and show that it works.