Sp ecifically, you should write Scheme procedures for heap as in lecture: create-heap, h-min, left, right, insert,insert-list, and remove-min. The difference bet ween these and the code we discussed in lecture is that each entry consists of a pair, and the second element of the pair is a number that is used in ordering the heap. It w make your code clearer if you define two functions for the pairs that you put in the heap, value and weight. Given
OR
OR