Question 1 1 pts Choose the best answer. Prim's algorithm: a. Finds the shortest path between the source node and all other nodes of a graph in polynomial time. b. Finds the best job selection from a list of positive payouts in exponential time. c. Finds a Hamiltonian path in a graph in pseudo-polynomial time. d. Finds a minimum spanning tree of an undirected connected graph in polynomial time