The table below compares the six different search algorithms discussed in class using four evaluation criteria completeness, optimality, space complexity, and time complexity. Complete the table that compares the search algorithms using these criteria.

Criterion	Breadth- First	Depth- First	Depth-Limited	Iterative Deepening	Bidirectional	Uniform Cost
Complete?
Optimal?
Time
Space

Question 5 (25 points):

Consider a state space where the start state is the number 1 and each state k has two successors: numbers 2k and 2k + 1.

a) Draw the portion of the state space from 1 to 15.

b) Suppose the goal state is 11. List the order in which the nodes will be visited for breadth-first search, depth-first search, depth-limited search with limit 3, and iterative deepening search.

c) How well would bidirectional search work on this problem? What is the branching factor in each direction of the bidirectional search?