Make a Markov chain model of a poker game where the states are the number of dollars a player has. With probability .3 a player wins 1 dollar in a period, with probability .4 a player loses 1 dollar, and with probability . 3 a player stays the same. The game ends if the player loses all his or her money or if the player has 6 dollars (when the game ends, the Markov chain stays in its current state forever). The Markov chain should have seven states, corresponding to the seven different amounts of n1oney: 0, I , 2, 3, 4, 5, or 6 dollars. If you now have $2, what is your probability distribution in the next round? In the round after that?

a, b, c, d are correct.

step-by-step explanation:

we have g(x) = 3 and are required to find which option is a translation of g(x).

now, 'translation' is a transformation which means to shift the function in any direction and the general form of translation is g(x) + k, where k is any real number.

so, according to the options we see that all are correct as they satisfy the general form of translation.

also, it can be seen from the graph below that the function g(x) = 3 is shifted from its position in all the four options.

final total: 63

step-by-step explanation:

60 times sales tax

60 times 0.05

3

60 + 3

63

range =5

step-by-step explanation:

to find the range, we take the largest value and subtract the smallest value.

the largest value is 5

the smallest value is 0

the range is 5-0   =5

33/100 is what i got