Q$\mathrm{.}3)$ Evaluate the search strategies given below along the following dimensions: Completeness, Time

complexity, Space complexity, and Optimality. Assume a tree search where b is the finite

branching factor; d is the depth to the shallowest goal node; $m$ is the maximum depth of the

search tree; $C^{*}$ is the cost of the optimal solution. In Bidirectional search, you can assume both

directions use breadth$-$first search.

Marks