Use the statement counting approach to show that the worst-case time complexity of the heap insertion and deletion algorithms given above in Section 2.1 are O(log n)