Due: Tuesday, April 13

Chapter 6: Exercises:

4 (show state-space tree. Number the tree nodes in the order that they are removed from the priority queue.),

7 (show state-space tree. Number the tree nodes in the order that they are removed from the priority queue.), and

9 (write a program. You do not need to implement your own priority queue class, i.e., you may use a previously implemented one. For extra credit you can implement your own priority queue class by representing a heap stored in an array.)