Question 664361: Please help!
Construct a tree diagram showing all four-letter arrangements, without repetition, from the set:
{D, S, U, X} to answer the question below.
What are the total number of possible arrangements
explain how you got the answer please!
Found 2 solutions by lynnlo, jim_thompson5910:
Answer by lynnlo(4176)   (Show Source):
Answer by jim_thompson5910(35256) (Show Source):
You can put this solution on YOUR website! To make a tree, you start with S, D, U, X as 4 separate branches. Then off of each branch, you add 3 more branches of whatever letter you took.
For example, off the 'S' branch, you add the letters 'D', 'U', and 'X' as 3 additional branches.
This will give you the following tree diagram
|
|
|
