Given the following sequence of integer keys

1.

Given the following sequence of integer keys:
7
17 14 30 20 27 29 11 10
report the structure of a hash table with size equal to
13, assumed initially empty, in which such a sequence
is inserted. Use the linear chaining strategy, defining an
appropriate hash function.

2.

3.

2. Insert the following set of keys into a BST, initially
empty: 11, 31, 88, 80, 15, 13, 68, 57, 24, 9.
Walk it in pre-order and post-order, printing the
keys as resulting from the walks

4.

5.

Perform a DFS starting from node a.
Perform a BFS starting from node d, drawing the resulting tree.

6.

7.

8.

By using the Dijkstra algorithm, determine the shortest paths connecting
vertex a with all the other graph nodes.