An urn contains two red and two green balls. The balls are chosen at random, one by one, from the urn. If a red ball is chosen, it is removed. Any green ball that is chosen is returned to the urn. The selection process continues until all of the red balls have been removed from the urn. a) Find a transition probability matrix P. Find all states which are accessible from state 1. b) Find P(X3 = 0|X1 = 2, X2 = 1). c) Is this chain irreducible? Explain. Please answer parts a, b, and c.
An urn contains two red and two green balls. The balls are chosen at random, one by one, from the urn. If a red ball is chosen, it is removed. Any green ball that is chosen is returned to the urn. The selection process continues until all of the red balls have been removed from the urn.
a) Find a transition
b) Find P(X3 = 0|X1 = 2, X2 = 1).
c) Is this chain irreducible? Explain.
Please answer parts a, b, and c.
Introduction :-
Given :-
An urn contains two red and two green balls. The balls are chosen at random, one by one, from the urn. If a red ball is chosen, it is removed. Any green ball that is chosen is returned to the urn. The selection process continues until all of the red balls have been removed from the urn.
We have to find,
- a transition probability matrix P. Find all states which are accessible from state 1.
- P(X3 = 0|X1 = 2, X2 = 1).
- Is this chain irreducible?
Step by step
Solved in 4 steps with 3 images