Alice is a good gambler and always knows when to stop. Suppose in a game, in each round she has a winning probability of 0.8 and she will stop at the first loss. Try to find the upper bound on the probability that she can win at least 10 rounds using Markov's inequality.

The answer is "0.500".

Step-by-step explanation:

The chance that round will be won,

The likelihood of losing round by complementary law

Let X be the number of rounds to the first loss played.

Here,

The PMF of X is the following:

The mean of X is the geometric random variable property,

Markov's Inequality:

Suppose X is any random variable that has no negatives. So,

Find the upper bound of

 The highest probability is, therefore, that Markov's inequality will win at least ten rounds: 0.500

not me

step-by-step explanation:

i wish i did i would like to get a desert ghost ball python