Which of the following lists of data structures best fits th

Which of the following lists of data structures best fits the list of graph algorithms? Depth First Search(DFS) Breadth First Search(BFS) Prim\'s Minimum Spanning Tree Kruskal\' Minimum Spanning Tree Queue Stack Priority Queue Union Find Stack Queue Priority Queue Union Find Queue Stack Union Find Priority Queue Priority Queue Queue Stack Union Find

Solution

2nd option is correct

1) DFS uses Stack....

2)BFS uses Queue

3)Prim\'s Minimum Spanning Tree uses Priority Queue

4)Kruskal\'s Minimum Spanning Tree uses Union Find...