SOLUTION: PLEASE HELP!!!!!!!!!!!!!!!1 Construct a tree diagram showing all four-letter arrangements, without repetition, from the set: {D, S, U, X} to answer the

Algebra ->  Permutations -> SOLUTION: PLEASE HELP!!!!!!!!!!!!!!!1 Construct a tree diagram showing all four-letter arrangements, without repetition, from the set: {D, S, U, X} to answer the      Log On


   



Question 664394: PLEASE HELP!!!!!!!!!!!!!!!1
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?

Answer by lynnlo(4176) About Me  (Show Source):
You can put this solution on YOUR website!
TREE DIAGRAM
D,S,U,X
D,U,S,X
D,X,U,S
YOU CAN GET3X4=12 ARRANGEMENTS
PUT THE LETTERS 3 DIFFERENT WAYS TIMES4 LETTERS=12
D,S,U,X
D,U,X,S
D,X,S,U==THIS IS AN EXAMPLE OF THE THE DIAGRAM