Which of the following search methods are examples of uniformed search?

Breadth first search

Depth first search

A* search

Minimax search

If you use breadth first search (BFS) to find a path from where you are to the exit out of a maze represented as a 2D map with 1x1 meter squares, which of the following statements are true?

BFS will find a path to the exit (if there is one).

BFS will find the shortest path (if there is one).

The first path found will be the shortest path.

BFS may get stuck in an infinite loop.

If you use breadth first search (BFS) on the traveling in Romania problem, which of the following statements are true?

BFS will find a path between any pair of cities.

BFS will find the shortest path between any pair of cities.

The first path found will be the shortest path.

BFS may get stuck in an infinite loop.