SOLUTION: A tree diagram has two stages. Stage 1 has two nodes and stage 2 has four nodes.
In stage 1, the branch from the starting position to node A is labeled 0.3. The branch from the st
Algebra ->
Probability-and-statistics
-> SOLUTION: A tree diagram has two stages. Stage 1 has two nodes and stage 2 has four nodes.
In stage 1, the branch from the starting position to node A is labeled 0.3. The branch from the st
Log On
Question 1196656: A tree diagram has two stages. Stage 1 has two nodes and stage 2 has four nodes.
In stage 1, the branch from the starting position to node A is labeled 0.3. The branch from the starting position to node B is an answer blank.
In stage 2, the branch from node A to node C is an answer blank. The branch from node A to node D is labeled 0.4.
In stage 2, the branch from node B to node C is labeled 0.2. The branch from node B to node D is an answer blank.
Outcome
P(A ∩ C) =
P(A ∩ D) =
P(B ∩ C) =
P(B ∩ D) =
You can put this solution on YOUR website!
given:
Stage 1 has two nodes and stage 2 has four nodes.
In stage 1, the branch from the starting position to node is labeled . The branch from the starting position to node is an answer .
In stage 2, the branch from node to node is an answer . The branch from node to node is labeled.
In stage 2, the branch from node to node is labeled. The branch from node to nodeis an answer .
recall: The sum of the probabilities on the branches leaving any node is . This allows us to fill in the middle two blanks.
then
In stage 1, the branch from the starting position to node is labeled . The branch from the starting position to node will be .
In stage 2, the branch from node to node is. The branch from node to node will be labeled .
In stage 2, the branch from node to node is labeled . The branch from node to node will be.
Outcome
P(A ∩ C) =
P(A ∩ D) =
P(B ∩ C) =
P(B ∩ D) =
