PROBLEM 5 (30 points) A) Suppose that the following keys (right table) are inserted into an initially empty linear-probing hash table, but not necessarily in the order given And it results in the following hash table D 5 2 3 4 5 6 Assuming that the initial size of the hash table was 7 and that it did not grow or shrink, circle all possible keys that could have been the last key inserted. B) How many different B-Trees could be created with keys 1,2,3,4 and 5 (with t-3)? Show them. C) Which algorithm would you use to find the shortest paths from a node to all other nodes in a graph with negative edges? A) Dijkstra B) Kruskal C) Bellman-Ford D) BFSE) Prim F) Floyd-Warshall D) Which data structure should an operating system use to schedule all the current processes based on their priorities? Why? True/False E) In an undirected graph G with distinct nonnegative edge weights, if we increase all the edge weights by I. all shortest paths will stay the same. F) The complexity of building a heap from an unsorted array of size n is O(n). G) The complexity of searching an item in a B.-Tree can be the same as the complexity of searching in a BST with a careful design. 1H1) The complexity of running Dijkstra's algorithm with adjacency list representation is (VlogE)