Exercise 3.3 a. In the Kuhn tree on the next page, determine the conditional probability of each terminal node, assuming that the play- ers' strategy selection has made that node attainable. (Thus, for the topmost node it is .4*.7 = .28.)13 b. With the help of the answer to a, calculate the strategic-form matrix of this game. (Thus, the selection (ag, ce) pays (36, 20).) (100.0) ( 0.100) ( 0.100) (100,0) Ch II ch (0.50) 1 ( 50,0) 1 ( 50, 0) ( 050) 5 " (0, 0) (0, 0) Ch START 10.0) 1 (0,0) 5 ch 10 ( 40,0) (0, 40) (0.40) ( 40,0) in 11 I d | OC 0 ch (0.80) ( 80, 0) ( 80, 0) (0.80) 7 Exercise 3.3 a. In the Kuhn tree on the next page, determine the conditional probability of each terminal node, assuming that the play- ers' strategy selection has made that node attainable. (Thus, for the topmost node it is .4*.7 = .28.)13 b. With the help of the answer to a, calculate the strategic-form matrix of this game. (Thus, the selection (ag, ce) pays (36, 20).) (100.0) ( 0.100) ( 0.100) (100,0) Ch II ch (0.50) 1 ( 50,0) 1 ( 50, 0) ( 050) 5 " (0, 0) (0, 0) Ch START 10.0) 1 (0,0) 5 ch 10 ( 40,0) (0, 40) (0.40) ( 40,0) in 11 I d | OC 0 ch (0.80) ( 80, 0) ( 80, 0) (0.80) 7