Second Question (True or False) 3 1 (True or False) (P(A) V Q(A)) ^ Q(A) is a legal Horn FOL sentence. 2 (True or False) The simple Alpha-beta game tree search algorithm described in the notes and Russell & Norvig is immune from the problem of game-trees with loops. (True or False) (A^B) = (AVB) (True or False) Because decision trees learn to classify discrete-valued outputs instead of real-valued functions it is possible for them to under fit. (True or False) The XOR function can be learned by a single perceptron with two 5 Inputs and one output. 6 (True or False?) Every sentence in first-order logic is either valid or unsatisfiable. 4 Page of