Q5. (8 points, 2 points each) Which of the following statements about alpha-beta pruning are true or false? Justify your answer. a. Alpha-beta pruning may find an approximately optimal strategy, rather

than the mini- max optimal strategy. b. Alpha-beta prunes the same number of subtrees regardless of the order of child nodes. c. Alpha-beta generally requires more run-time than minimax on the same game tree. d. the minimax search is bredth-first, so at any point we have to consider the nodes at a level. Answer: