1. Draw a tree that satisfies both the binary search property and the order property of heaps.
2. A minimum heap has the following order property: The value of each element is less than or equal to the value of each of its children. What changes must be made in the heap operations given in this chapter?