1 Create a Hash table (Linear probing implementation size 8) on the following data: 108, 106, 202, 28, 73, 7 Indicate the hash function result for each insertion. Draw the final contents of the array (Non-anonymous question ) (6 Points) 2 Create a Hash table (linked list/chaining implementation size 4) on the following data: 108, 106, 202, 28, 73, 7 Indicate the hash function result for each insertion. Draw the final contents of the linked lists. (Non-anonymous question o) (6 Points) 3 The following is an array representation of a directed graph: V = {A, B, C, D, E, F} E={(E,A,3),(A,C,4),(C,D,1),(A,B,3),(B,A,2),(C,F,3),(F,C,4)} Draw the graph (Non-anonymous question o) 4 The following is a array representation of a directed graph: V = {A, B, C, D, E, F) E={(E,A,3),(A,C,4),(C,D,1),(A,B,3),(B,A,2),(C,F,3),(F,C,4)} Draw the Matrix representation (Non-anonymous question o) (6 Points) 5 Indicate the components of the graph (from question 3 and 4) (Non-anonymous question o) (3 Points)