Question # Answer with True or False. 1. (A VB) =( AB) 2. (P(A) V Q(A))^(- T(X) V (W(Y)) is a Conjunctive Horn form 3. Vxv y x = y is a satisfiable sentence. 4. A complex breadth-first search will always find the shortest solution if one exists and it is of finite length 5. A* is not always the best" algorithm 6. Breadth first search guaranteed to find the optimal path. 7. Frames are good when you have to describe an object with inherited data. 8. In a Production System, a rule activates itself always when its condition matches the content of the workspace. 9. P(A)^Q(A) is a Horn form sentence. 10. Prolog uses best first search when it is looking for all possible solution. 1 2 3 5 6 7 8 9 10