Choose the correct statements below.

Group of answer choices

The MST trees built by the Prim's and Kruskal's Algorithms have the same cost $($total edge weight$)$

The MST trees built by the Prim's and Kruskal's Algorithms are identical $($have the same tree structure$)$

The Prim's and Kruskal's algorithms work on both directed and undirected graph.

The Dijkstra's algorithm works on both directed and undirected graph.

The Prim's and Kruskal's algorithms work on the graph with negative weights.

The Dijkstra's's algorithms work on the graph with negative weights.

The Prim's and Kruskal's algorithms have the same time complexity.

The Prim's and Dijkstra's algorithms have the same time complexity.

The trees built by the Prim's and Dijkstra's Algorithms have the same cost $($total edge weight$)$

All the Prims', Kruskal's, and Dijkstra's algorithms are all the greedy approaches using a certain selection criteria.