 Here, the Backward Induction solution emerges step by step. Stage 1 of the procedure rules out the leaf labeled with (\(2,2\)) as the only point where \(\rat \) fails. Stage 2 then rules out E’s choice node as new node where \(\rat\) fails. In the resulting game tree, \(\rat \) holds throughout.