1. [6] Starting with an empty hash table with a fixed size of 11, insert the following keys in order into four distinct hash tables (one for each collision mechanism): 12, 9, 1, 0, 42, 98, 70, 3. You are only required to show the final result of each hash table. In the very 1ikely event that a collision resolution mechanism is unable to successfully resolve, simply record the state of the last successful insert and note that collision resolution failed. For each hashtable type, compute the hash as follows: hashkey(key) (key * key + 3) % 11 Separate Chaining (buckets 2 9 10 To probe, start at i-hashkey and do i++ if collisions continue Linear Probin robe(i')-(i + 1) % Tablesize 2 9 10 uadratic Probing: probe(i') = (i * 1 + 5) 96 TableSize 2 9 10 2. [3] For implementing a hash table. Which of these would probably be the best initial table size to pick? Table Sizes: 100 101 15 500 Why