Read Algorithms 3.1, 3.5 and 3.2

Do the following problems from the text. (Not handed in.)

  3.1.10

    Give a trace of the process of inserting the keys
       E A S Y Q U E S T I O N 
    into an initially empty table using SequentialSearchST. How many
    compares (of keys) are involved?  

  3.1.11

    Give a trace of the process of inserting the keys
       E A S Y Q U E S T I O N 
    into an initially empty table using BinarySearchST. How many
    compares (of keys) are involved?