Analysis of algorithms

Written response only

QUESTION acall that hashing imvoves stording keys in a table, at the address computed by a hash function. When the hash function that there is a collision for two differant keys, we say the same address Unear probing quadrade probing and double hashing are three different strategles to address strategies as indicated below provides a Linear Probing Create a hash table with 8slots (m 8), using the hash function h (k)- K mod m, and insert the folowing elements into the hash table: 36, 18, 72, 43, and 6 inserted in that order. Use linear probing to resove collisions. b. Quadratic Probing: Create a hash table with 10 slots (m-10), using the hash function h (K) K mod m, and Insert the following elements into the hash table: 89, 18, 49, 58, and 69 inserted in that order. Use quadratic probing to resolve collisions. c Double Hashing: Create a hash table with 10 slots (m 10), using the hash function h (K) K mod m, and insert the following elements into the hash table: 89, 18, 49, and 69 collisions inserted in that order. Use double hashing to resolve Let the primary hash function be H1(key) key mod 10, and the secondary hash function be H2(key)#7-(key mod 7). What are the advantages of double hashing? T T Arial