[solved]-1 Would Seem Iterative Deepening Search Higher Asymptotic Time Complexity Breadth First Se Q38989046

only Q2 and Q3. Thanks.

1. It would seem that iterative deepening search should have a higher asymptotic time complexity than breadth-first search because every time the depth-bound is increased it must start its search from scratch. However this is not true given the algorithms presented in class. Why? 2. If h() is admissible and s is the start node, how is h(s) related to the cost of the solution found by A* search? 3. What happens if we use a heuristic h() in A* search that does not have the guarantee that h(n) <h*(n) for all states n? Show transcribed image text 1. It would seem that iterative deepening search should have a higher asymptotic time complexity than breadth-first search because every time the depth-bound is increased it must start its search from scratch. However this is not true given the algorithms presented in class. Why? 2. If h() is admissible and s is the start node, how is h(s) related to the cost of the solution found by A* search? 3. What happens if we use a heuristic h() in A* search that does not have the guarantee that h(n)

Expert Answer

---

Answer to 1. It would seem that iterative deepening search should have a higher asymptotic time complexity than breadth-first sear… . . .