# Satish picks a card at random from an ordinary pack. If the card is ace, he stops; if not, he continues to pick cards at random, without replacement, until either an ace is picked, or four cards have been drawn. The random variable C is the total number of cards drawn. Construct a tree diagram to illustrate the possible outcomes of the experiment, and use it to calculate the probability distribution of C.

Satish picks a card at random from an ordinary pack. If the card is ace, he stops; if not, he continues to pick cards at random, without replacement, until either an ace is picked, or four cards have been drawn. The random variable C is the total number of cards drawn. Construct a tree diagram to illustrate the possible outcomes of the experiment, and use it to calculate the probability distribution of C.
You can still ask an expert for help

• Questions are typically answered in as fast as 30 minutes

Solve your problem for the price of one coffee

• Math expert for every subject
• Pay only if we can solve it

Step 1
Perhaps it would be easier to write it out as a piece of code-viz,
if first card is an ace
$C=1$
else if second card is an ace
$C=2$
else if third card is an ace
$C=3$
else
$C=4$
Step 2
Now, draw the above as a tree. Start with a "52 cards, 4 aces" node, and have two branches coming out of it: one for ace, and one for not-ace. The ace branch leads to a node with $C=1$ ; this node is a leaf. The not-ace branch leads to another node "51 cards, 4 aces" with two branches: one for ace, and one for not-ace. The ace branch leads to a node with C=2; this node is a leaf. Again, the not-ace branch leads to another node with two branches. And so on.
Nexct, label each branch with its associated probability. For instance, the first two branches have probability $4/52=1/13$ and $48/52=12/13$, respectively. Finally, use independence and multiplication to determine the probability of ending up at each leaf node.
###### Not exactly what you’re looking for?
Graham Beasley
Step 1
You are being asked to construct a Decision tree based on wether you draw an ace or not.
You will have four nodes, for one, two, three, or four cards drawn, as well as 'start' and 'stop'. The decision after each node is "Was the last card an ace?"; if "yes", report the count then go to 'stop', if "no" then move to the next draw. But automatically report "4" and go to 'stop' if you reach the fourth draw.
To calculate the probability of each result, evaluate the probability of each decision's answer needed to reach that result, and multiply.
For bonus points, instead of a chain, include a loop decision in the process.