For this question, we will use the heap-supporting functions as seen in the lecture slides as building blocks for this assignment to build a new heap implementation. The heap implementation shown in the lecture slides is an example of a min-heap, in which the smallest element is at the root and an elements in child trees are larger than the value at the root. We can also construct max heap data structures in which the largest element in the heap is at the root and all elements in child trees are smaller than the root

The objective is to define SCHEME functions to manipulate a heap which
1. maintain a binary tree as a heap,
2. use a generic (first order) order relation
3. provides functions which can determine if a heap is empty as well as heap. insert heap-renove and combine-heaps

Define a SCHEME function, named (heap-remove f H) which takes two arguments, a heap and a firstorder relation, a heap containing the elements of H with the root value removed. Note, heap-remove