pls send correct answers and pls send it fast

b) A haush table is implement using an array of siz 8. The objects A to are inserted in this Order int hash table The Hash 1 and Hash Valuca for there objects are A B t F Hash 1: 11 9 Hash 2: 3 7 13 (Note if the list probed for ofject X are 2 S of indenes arrays and finally o, then it "X s 24 of can be written the form . linear in Assuming probing strategy is employed wring Hash 1 hash values, list the sequence of addresses probed for each object and draw the final state of resulting hash table array de Assuming double hash ic the strategy the Hash 1 Values cos employed using hash values, primary Secondary one, list the each object and the Hash 2 Nalues as the Sequence of addresses Probed for ound draw final state of the resulting hash table array Juded implement using an b) A haush table objects hash table array of size 8. The A to P are inserted in this Order into The Hash 1 and Hash 2 Valua for there objects are ; A B D E F Hash 1 : 1 1 9 Hash 2: 1 3 7 1 3 5 ofject (Note, if the list of indenes arrays 2,5 and finally o the form "X - 2 so X are probed for finally o, then it can be written in in Assuming linear probing strategy is employed along the Hash 1 hash Values, list the Sequence of each for probed object and addresses final state draw the of resulting hash table array a Assuming double hash ic the strategy the Hath 1 Values as employed, using hash values, primary Secondary one, list the each object and the Hash 2 Nalues as the Sequence of addresses Probed for ound draw final state of the resulting hash table array