7) For hashing an item into a hash table in which collisions are resolved by chaining, the worst- case time is proportional to the load factor of the table. A) True B) False 8) For a graph G and a node v in that graph, the DFS (Depth First Search) and BFS (Breadth First Search) tree of G rooted at v always contain the same number of edges. A) True B) False 9) What is the worst case time complexity for the following sorting algorithm in terms of data size n. Worst Case Time Complexity Sorting Algorithm Insertion Sort Merge Sort 10) Give a tightest possible bound for the runtime complexity of the following C code fragments in terms of the value of the input size n. Just write down the expression. You don't have to simplify it. = for (i = n; i > 0; i--) { for (j 0; j