4. Consider the following directed graph. [20] 9 F 10 4 4 4 8 8 3 3 S B B E E 7 6 2. 3 5 7 C D T 11 12 (a) Find the shortest path from S to all other nodes using Dijkstra's algorithm. Show detailed computation of your answer. (15 points) (b) Given an undirected graph, how can you determine that the given graph also satisfies the condition of a Tree. Justify your answer with a suitable example. (5 points) 5. Assume that the size of the hash table is 7 and the hash function is h(k)= k mod 7. [20] Draw the contents of the hash table using both Linear probing and Quadratic probing for the following sequence of values. 17, 35, 18, 10, 42, 26