Hi , I got some multple choice questions that I need some help with. I appreciate the assistance

1) Which of the following traversals is best in terms of time and finding the optimal path?

	a.	None of these
	b.	A*
	c.	Breadth First Search
	d.	Greedy First Search

2) What data structure does Dijkstra's algorithm use to help it choose which vertex in a graph to visit next?

	a.	a stack
	b.	a queue
	c.	an array
	d.	a priority queue

3) Which type of traversal guarantees that we find the most optimal path between two nodes in a graph?

	a.	None of these
	b.	Depth First Search
	c.	Greedy First Search
	d.	Breadth First Search

4) To solve the shortest path problem of a weighted graph using non-negative weights we would preferably use ________'s algorithm.

	a.	None of these
	b.	Bellman-Ford
	c.	Dijkstra
	d.	Floyd-Warshall

4) If we finish Dijksta's algorithm and a node still has an estimated distance of infinity this means _______.

	a.	an error occurred
	b.	a path does not exist from the source to that node
	c.	that we need to run the relaxation method again
	d.	None of these