Vlad is to play a 2-game chess match with gary and wishes to maximize his chances of winning. to do this, he may select a strategy right before he plays each game: timid or bold. (note: this means that vlad may choose his strategy in the second game after he knows the result of the first game.) (a few remarks on chess matches: a 2-game match means that the players play exactly two games, with a win counting 1, a draw counting 0.5, and a loss counting 0. the player with more points wins the match. note that the match may end in a tie, if, for example, each player wins one game.) unfortunately, gary is the superior player. if vlad plays timidly, gary will still win 10 percent of those games, and the rest will be draws. if vlad plays boldly, gary will win 5/9 of those games, and lose the rest. assume vlad selects his strategies optimally, and find (a) the probability that he wins the match, (b) the probability that the match ends in a tie, and (c) the probability that gary wins the match. (n. b. the problem requires that you determine vlad's optimal approach to the match.)