document.write( "Question 664361: Please help!\r
\n" ); document.write( "\n" ); document.write( "Construct a tree diagram showing all four-letter arrangements, without repetition, from the set:\r
\n" ); document.write( "\n" ); document.write( " {D, S, U, X} to answer the question below.\r
\n" ); document.write( "\n" ); document.write( "What are the total number of possible arrangements\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "explain how you got the answer please!
\n" ); document.write( "

Algebra.Com's Answer #413330 by jim_thompson5910(35256)\"\" \"About 
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.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "For example, off the 'S' branch, you add the letters 'D', 'U', and 'X' as 3 additional branches.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "This will give you the following tree diagram\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "
\n" ); document.write( "
\n" );