You enter a special kind of chess tournament, in which you play one game with each of three opponents, but you get to choose the order in which you play your opponents, knowing the probability of a win against each. You win the tournament if you win two games in a row, and you want to maximize the probability of winning. Show that it is optimal to play the weakest opponent second, and that the order of playing the other two opponents does not matter.

the correct answer is b. negative exponential growth.

step-by-step explanation:

you can tell it's an exponential function because it decreases rapidly then levels out and never touches the x-axis.

it is negative because the y-axis decreases as the x-axis increases.

therefore it is a negative exponential growth graph.

hope i !

$15 each

step-by-step explanation:

$45/3 children= $15 each

irrational, cannot

whole number data type

step-by-step explanation:

as whole number type represents whole number

like 1, 2 ,3, 4

in other words the whole numbers are those numbers which cannot be written infraction.

since we can take days as a whole number i.e 1 day 2 day and we cannot write 1.2 day hence we will use whole number data type