After our lecture on hashing, you find yourself really excited about hashing with chaining. Your friend on the other hand thinks that hashing with open addressing is a very neat idea to handle...

I am having a hard time finding the right approach for the question. I need a justified answer. Could you please help me through?

E2? Carefully show your work and explain your answer. Note that citing expected runtimes from lecture is not a sufficient solution. "/>
Extracted text: After our lecture on hashing, you find yourself really excited about hashing with chaining. Your friend on the other hand thinks that hashing with open addressing is a very neat idea to handle collisions. So you design a hash table Tc (meaning Table with Chains) which uses chaining to resolve collisions. Each chain in Tc is a doubly-linked list where insertions are done at the front of the list. Your friend designs a hash table Tp (meaning Table with Probing) which handles collisions using linear probing. When deleting items from Tp, the item deleted is replaced with the special "tombstone" marker. For both tables, you use the same hash function and Tc and Tp have the same umber of buckets which is much larger than the number of items you wish to hash. Then the two of you go to a third friend (who now works at a big tech company) to help you decide which is better. She asks you the following questions which you must answer as your submission for this problem. (a) If you perform a sequence S of Insert and Delete operations on your tables, which table is going to require fewer comparisons? Assume that S is comprised of a sequence of n operations O1, 02, O3, ..., On where 1 <>< n. n is smaller than the number of buckets. use kci to refer to the number of item comparisons made when performing o; on tc. similarly, use kp; to refer to the number of item comparisons made when performing (the same) o; on tp. for 1 e2? carefully show your work and explain your answer. note that citing expected runtimes from lecture is not a sufficient solution. n.="" n="" is="" smaller="" than="" the="" number="" of="" buckets.="" use="" kci="" to="" refer="" to="" the="" number="" of="" item="" comparisons="" made="" when="" performing="" o;="" on="" tc.="" similarly,="" use="" kp;="" to="" refer="" to="" the="" number="" of="" item="" comparisons="" made="" when="" performing="" (the="" same)="" o;="" on="" tp.="" for="" 1="" e2?="" carefully="" show="" your="" work="" and="" explain="" your="" answer.="" note="" that="" citing="" expected="" runtimes="" from="" lecture="" is="" not="" a="" sufficient="">