1. Which of the persistence techniques described in class would be most
appropriate for constructing a partially persistent hash table? Explain
your answer.

2. What would be the time and space per update of a fully persistent
binomial heap, implemented using the path copying technique?

3. Draw a Cartesian tree for the sequence 12,9,11,10,7,8,13,6,15.