Consider the game tree picture below where nodes A to F represent some real values. Assume the nodes are explored from left to right and standard alpha beta pruning is used. (a) Give a value of A such that B is pruned. (2 marks) (b) Give a value of A such that B is not pruned. (2 marks) (c) True or False: There are some values of A and B such that the subtree containing C and D is pruned. (2 marks) (d) Assuming that B=5 and A=5, give a value of C and D such that the subtree containing E and F is pruned. (2 marks) (e) If you are allowed to assign A to F arbitrarily, what is the maximum number of leaves that can be pruned? (2 marks)