# The worst case running time of KruskalA????1s algorithm to compute a minimum spanning tree of a conn

The worst case running time of KruskalA????1s algorithm to compute a minimum spanning tree of a connected undirected graph G = (V, E), using a heap and union/find data structures to implement union-byheight. ____________ b. The worst case running time of PrimA????1s algorithm to compute the minimum spanning tree of an undirected graph G = (V, E), represented by an adjacency list and using an array to keep track of vertex labels. ____________ c. The worst case running time of PrimA????1s algorithm to compute the minimum spanning tree of an undirected graph G = (V, E), represented by an adjacency list and using a heap to keep track of vertex labels. ____________ d. The worst case running time of Bucket Sort on an array of n integers, each of which has a value in the range of 0 .. m. ____________ e. The solution (ignoring constant factors and lower-order terms) of the following recurrence equation: T(1) = 1, T(n) = 3T(n/2) + n. ____________ f. The worst case running time of depth-first search on an undirected graph G = (V, E), represented as a adjacency matrix. ____________ g. The worst case running time of the greedy algorithm that solves the Fractional Knapsack Problem consisting of n items (defined by a weight and value) and a knapsack of capacity W. ____________ h. The worst case running time to calculate a n using the binary exponentiation algorithm. ____________ i. The maximum number of edges in an undirected graph G = (V, E). (Do not include self-loops.) ____________ j. The number of vertices that are chosen to be part of the A????1knownA????1 set in DijkstraA????1s algorithm when given a connected undirected graph G = (V, E) as input.