Ask Question
21 August, 18:38

Desmond lives in Melbourne and is taking a trip to Sydney. He can travel to Sydney and back in 333 different ways: by bus, cab, or train. Desmond chooses how to get to Sydney and back at random.

Which of these tree diagrams can be used to find all of the different ways that Desmond can get to Sydney and back?

Choose all answers that apply:

Choose all answers that apply:

(Choice A)

A

Diagram A

(Choice B)

B

Diagram B

/text{B} = / text{Bus} / / / text{C} = / text{Cab} / / / text{T} = / text{Train}B=Bus

C=Cab

T=Train

Diagram A:

Diagram B:

+3
Answers (2)
  1. 21 August, 18:55
    0
    Diagram B
  2. 21 August, 19:00
    0
    I think answer is a.
Know the Answer?
Not Sure About the Answer?
Find an answer to your question 👍 “Desmond lives in Melbourne and is taking a trip to Sydney. He can travel to Sydney and back in 333 different ways: by bus, cab, or train. ...” in 📗 Mathematics if the answers seem to be not correct or there’s no answer. Try a smart search to find answers to similar questions.
Search for Other Answers