Question 3 (a) A hash table is implemented using an array of size 8. The objects A to F are inserted, in this order into the hash table. The Hashi and Hash2 values for these objects are: A B C D E F Hashi: 11 1 1 9 0 1 Hash2: 1 3 7 13 5 [Note, if the list of array indexes probed for object X are 2, 5 and finally 0, then it can be written in the form: "X 25-0"] (1) Assuming a Linear Probing strategy is employed using the Hashi hash values, list the sequence of addresses probed for each object and draw the final state of the resulting hash table array, [5 marks] (ii) Assuming a Double Hashing strategy is employed, using the Hash1 hash values as the primary hash values, and the Hash2 values as the secondary one, list the sequence of addresses probed for each object and draw the final state of the resulting hash table array, [5 marks