solve urgent more appreciate

Insert the keys 23 8 9 and 19, in this order, into an initially empty hash table of 7 slots, with slots numbered 0 through 6. Use H()-k an initially or hash function and linear probing for collision resolution. The final state of the table, in which the empty positions are marked by , is /2 marks O a. 23 1998 O b. 23 89 19 O c. 23 19 8-9 e. 19-9-23-8 O f.--8239.-19- Save Ans wer Question 12 of 27 /2 marks Which one of the following situations shows the result of inserting 3, 6 a. 5, 11. 19, and 7 into an initially empty binary heap? /2 marks a. 3, 6, 8, 5 11, 19. 7 b. 3 5. 6. 11.7.19.8 3.5,7,6 11. 19, a d. 19. 11,8. 7.6. 5. 3 2 19 11. 5 8.7 3 Rignts Reserved. Terms of Use | Privacy Policy | Contact Us l Attr Re Copyright 2018 :nt-ack Technologies ing All