Problem
1. Draw the heap that results when the following operations are performed on an initially empty heap: insert (1), insert (5), insert (2), insert (6), replace (4), insert (8), remove, insert (7), insert (3).
2. Is a file in reverse sorted order a heap?
3. Give the heap that results when, starting with an empty heap, insert is called successively for the keys EASY QUESTION.