1. Are the following topics covered in the chapter that you were supposed to read for today's class? mark Y (yes) or N (no) for each topic:

- binary search trees
- compilers
- queues
- stacks

2. Show, step-by-step, how the following three sorting methods will sort a list consisting of the numbers 6, 3, 22, 20, and 11: insertion sort, merge sort, and quick sort.