data structure and algorithms

The keys 12, 18, 13, 2, 3, 23, 5 and 15 are being inserted into a hash table with capacity 10 using hash function h(k) k mod 10 and linear probing. What is the resultant hash table? 0 0 0 0 1 1 1 1 2. 2 2 12 2. 12 2 12.2. 3 23 3 13 3 13 3 13, 3, 23 4 4 4 2. 4 5 15 55 53 55, 15 6 6 6 23 6 7 7 7 5 7 8 18 8 18 8 18 8 18 9 9 9 15 9 (A) (B) (C) (D) AO B D a. Find the adjacency matrix of the graph G = (V, E) where V = {a, b, c, d, e} and E = {ab,ae ba, bc, ca, ce, dc,da,eb,ec,ed}. b. Give the adjacency list and a drawing of the graph G = ([5], E) whose adjacency matrix is: 0 1 0 0 1 1 0 1 0 1 0 0 0 1 0 1 0 1 0 0 0 1 O 1 0 A hash function h defined h(key)=key mod 7, with linear probing, is used to insert the keys 44, 45, 79, 55, 91, 18, 63 into a table indexed from 0 to 6. What will be the location of key 45? 3 5 6 4