Consider the following game tree: Aa R B B H T H T A A A h t h h (2,1) (0,0) (0,0) (1,2) (2,1) (0,0) (0,0) (1,2) (a) List all the information sets of each player. (b) Define the strategy space of each player. (c) Does this game satisfy perfect recall? Explain.