A tree diagram has two stages. Stage 1 has three nodes and stage 2 has six 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 labeled 0.2. The branch from the starting position to node C is an answer blank. In stage 2, the branch from node A to node E is an answer blank. The branch from node A to node F is labeled 0.5. In stage 2, the branch from node B to node G is an answer blank. The branch from node B to node H is labeled 0.6. In stage 2, the branch from node C to node I is an answer blank. The branch from node C to node J is an answer blank. Node I is labeled P(I ∩ C) = 0.15. Node J is labeled P(J ∩ C) = 0.35 what are the values of  Outcomes P(A ∩ E) =  P(A ∩ F) =  P(B ∩ G) =  P(B ∩ H) =

A tree diagram has two stages. Stage 1 has three nodes and stage 2 has six 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 labeled 0.2. The branch from the starting position to node C is an answer blank.
• In stage 2, the branch from node A to node E is an answer blank. The branch from node A to node F is labeled 0.5.
• In stage 2, the branch from node B to node G is an answer blank. The branch from node B to node H is labeled 0.6.
• In stage 2, the branch from node C to node I is an answer blank. The branch from node C to node J is an answer blank.
• Node I is labeled P(I ∩ C) = 0.15.
• Node J is labeled P(J ∩ C) = 0.35 what are the values of 
  Outcomes
  P(A ∩ E)

  = 

  P(A ∩ F)

  = 

  P(B ∩ G)

  = 

  P(B ∩ H)

  =