A graph is connected if there is at least one path between anypair of vertices. a) explain what problem we designed prim’salgorithm to solve and how prims algorithm could be used todetermine if a graph is connected. b) Explain what problem wedesigned Dijkstra’s algorithm to solve and how Dijkstra’s algorithmcould be used to determine if a graph is connected.
Expert Answer
An answer will be send to you shortly. . . . .