Please solve ALL questions ! (5 questions)

please quickly I'm taking the quiz right now

Consider the following graph (G): AB E G D F Which of the following statements Describes the above graph correctly? Select one: O a. G is not Directed and not Completed b. G is Directed and not Completed c. G is Directed and Completed d. G is not Directed and Completed To compare the prim's algorithm and Kruskal's algorithm Select one: O a. both of them use edges O b. Kruskal's algorithm uses vertex connections and Prim's algorithm uses edges C. both of them use vertex connections O d. Kruskal's algorithm uses edges and Prim's algorithm uses vertex connections Depth First Search (DFS) is a linear time algorithm Select one: O True O False The shortest path between two vertices is unique if all edge weights are distinct. Select one: O True O False The number of strongly connected components for the graph below is: ( A E D G F ( J