What does the tree diagram look like?

Represent the following extensive game in extensive form (i.e., in a "tree diagram") and find its subgame perfect Nash equilibrium. (You do not need to walk through each step of backward induction; simply stating the SPE suffices.) . Players: {1, 2,3} . Terminal histories: {(C, F), (C, G), (D, H), (D, I), E} . Player function: P(0) = 1, P(C) = 2, P(D) = 3 . Payoffs: u] (C, F) = 0, u2(C, F) = 2, u3(C, F) = 3; u. (C, G) = 3, u2(C, G) = 1, u3 (C, G) = 0; ul (D, H) = 2, u2( D, H) = 3, u3(D, H) = 1; u1 (D, I) = 1, U2( D, I) = 2, u3( D, I) = 2; ul (E) = 2, u2( E) = 0, u3(E) = 0