USE THE BELOW INFORMATION, the slide is an example of the format for question 2 and 3.

i=0repeatj=h(k,i)ifT[j]==NILT[j]=kreturnjelsei=i+1 until i==m Insert keys 89,18,49,58,69 with h(k)=kmod10 h(k,i)=(h(k)+i)modmwherei=0,1,2m1 Quadratic probing h(k,i)=(h(k)+f(i))modm where f(i)=i2, and i=0,1,2.m1 1. Demonstrate the insertion of keys 5,28,19,15,20,33,12,17 into a hash table with collisions resolved by chaining. Let the hash table have 7 slots, and let the hash function be h(k)=kmod7. 2. Demonstrate the insertion of keys 5,28,19,15,20,33,12,17,10 into a hash table using open addressing with linear probing scheme. Let the hash table have 7 slots, and let the hash function be h(k)=kmod7. Hints: h(k,i)=(h(k)+f(i))modm, where f(i)=i, and i=0,1,2,3,,m1 3. Demonstrate the insertion of keys 76,93,40,35,47 into a hash table using open addressing with quadratic probing Let the hash table have 7 slots, and let the hash function be h(k)=kmod7. Hints: h(k,i)=(h(k)+f(i))modm, where f(i)=i2, and i=0,1,2,3,,m1