Could someone help me with the question below? :

Thank you for your time.

7. Consider the following weighted graph. A 7 11 4 S 12 2 D 6 E 19 8 3 a) Is the graph connected? b) Is the graph directed? c) List, in order, the edges added to the solution if we use the Prim's algorithm to construct the minimal spanning tree for this graph (specify an edge by providing the nodes at each end - e.g. A-D is the edge from node A to node D). Start with node A