4. Show the result of accessing the keys 3, 9,1, 5 in the following splay tree: 0010 Delete 6 from the splay tree that resulted from the previous question. 5. 0004 0011 0002 0012 0001 0005 0008 0013 0070000 6. Show that if all nodes in a splay tree are accessed in sequential order, the resulting tree consists of a chain of left children. Hint: Using this example splay tree prove to yourself this statement is true 0001 0003 0002 0005