1. (15 pts) Answer each of the following questions. Provide boundaries, if a single answer doesn't exist. a) [3 pts) A non-empty heap has n nodes. How many interior nodes does it have? b) [3 pts) A tree has n > 1 nodes. How many of them are interior nodes? c) (4 pts) What are the 2 discerning (interesting) "physical differences between a Heap and a Binary Search Tree? d) [3 pts) A non-empty tree of degree 7 has n nodes. How many edges does it have? e) [3 pts) A non-empty heap has L leaves. How many nodes does it have