Answer The Following Multiple Choice Questions And Choose the Correct Answer (A-D).

Question 1:

The A* algorithm is described as a:

Question 1 options:

A.	sorting algorithm
B.	shortest path algorithm
C.	string search algorithm
D.	longest path algorithm

Question 2:

The heuristic in the A* algorithm is:

Question 2 options:

A.	none of the above
B.	a measure of distance of the current node to the target
C.	a measure of distance of the current node from the start
D.	is a means to avoid obstacles

Question 3:

In the A* algorithm if we ignore the heuristic (h) and set h to zero then we recover the:

Question 3 options:

A.	Lee algorithm
B.	Dijkstra algorithm
C.	Voronoi algorithm
D.	none of the above