A 1 3 1 7 9 1 0 1 3 5 1 (a) A hash table is implemented using an array of size 8. The objects A to Fare inserted in this order into the hash table. The Hashl and Hash2 values for these objects are! BCDEF Hashi: 11 Hash2 [Note, if the list of array indexes probed for object X are 2, 5 and finally, then it can be written in the form: "X+2+5+0"] 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 () Assuming a Double Hashing strategy is employed, using the Hashi 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. (b) Consider the following graph: [5 marks] [5 marks] 3 4 2 5 5 E Demonstrate the execution of the Jarnk-Prim algorithm for finding the minimal spanning tree on this graph by writing out a table of the execution steps in the fol- lowing format where the first row, following initialisation, is already provided (initial node to add is node A): Finished A B 0,Aoo, B : C D E 00, C 0,D 00, E . . : Each row should show the results of one iteration of the algorithm after a node is added to the spanning tree, where the finished column identifies the node that is finished in that iteration, and the remaining columns show the current distance of the node of that column from the tree, the node that connects it to the tree and a tick mark if the node of the column is finished. [10 marks]