Can I get some help on this question with answer and detailed explanation? I just have no idea how to approach and where to start...

1: Backward Induction (3 pts) Solve the following games by backward induction (lpt per game). Re- member: in the Backward Induction solution you must determine players' behavior at all nodes, that is, also those that are prevented by previous play. Above any node you will nd a greek letter, and a name, for instance "4: Ann\". The greek letter is the name of the node, the second information is the name of the player. So you should write something like \" Ann goes Left at node 4, and goes Right at node 0. [3) (:Alice (2,4,2) (1,3,1) (2,3,2) (1,4;3) (b) n : Red (c) 7:1 stay 0:2 Stay \\:1 5m\" E ml En! El fl