data structure and algorithms

Given a hash table T[O....9] of 10 elements. Draw an image of this hash table after the keys 54,26,93,17,77,31,44,20, and 25 have been inserted in that particular order). Use the hash function h: U {0, 1, ...,9}, h(k) = k mod 10, and use linear probing to resolve collisions What is the Depth First Search of this graph? B E D ABCDE O ABCED ABEDC ABECD None of these