Consider the following problem in its extensive form and represent it in its normal form. Use the strict iterated elimination algorithm to find the solution set of the game SIESDS 

_{J1: Player 1}

_{J2: Player 2}

_{J3: Player 3}

S (2,3,3) S N (3, 4, 1) N S (3, 1,5) S N (4,2,2) J1 J2 J3 S N S N (1,4,5) (5,5, 2) N (5, 2, 6) N (6,6,4) S (2,3,3) S N (3, 4, 1) N S (3, 1,5) S N (4,2,2) J1 J2 J3 S N S N (1,4,5) (5,5, 2) N (5, 2, 6) N (6,6,4)