Please solution with detailed explanation

Question #. Answer with True or False. 1. A danger of depth-first search is that it may not terminate if the search space is infinite, even if a finite solution exists. 2. A sentence is satisfiable if it is true in all models. 3. Depth first search will find an optimal path with respect to the cost of the path. 4. Forward checking is a more powerful constraint propagation algorithm than arc consistency in that it can converge to a solution more quickly. 5. Knowledge base KB entails sentence a. For each model when KB is true a must be true. 6. Logic provides a flexible and powerful framework for representation and reasoningt 7. Prolog compiler uses Breadth First Search. 8. Semantic network is best when you have heuristic data. 9. Suppose you have a admissible heuristic h(n). Is this enough to do A* search and guarantee an optimal solution? 10. When doing alpha-beta pruning on a game tree which is traversed from right to left, the leftmost branch will never pruned. 1 2 3 4 5 6 7 8 9 10