1. Suppose the following array is given as input to quicksort (with median-of-three partitioning):
		24	13	8	28	18	1	32	10	19	45	15

a. What does the array look like after the initial reordering, but before the i and j counters begin marching? On the array, indicate where the i and j counters should begin, the direction that each counter will proceed, and the location of the pivot.
		1	13	8	28	18	45	32	10	19	15	24
		i-> 			   				    <-j	P
b. What is the content of the array after it has been partitioned for the first time, but before the two recursive calls to quicksort are made?
		1	13	8	10	15	45	32	28	19	18	24


2. Show the AVL tree that results when you start with an empty tree and insert the following numbers in the order shown
		29 	5 	24 	43 	15 	12	8 	32 	40 	13 	16

Answer:
         24
       /    \
     12      32
    /  \     / \
   5    15  29  43
   \   / \      /
    8 13  16    40