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. 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:

Answer 1

Answer:

Diagram B

Step-by-step explanation:

Answer 2

I think answer is a.