document.write( "Question 664394: PLEASE HELP!!!!!!!!!!!!!!!1\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?
\n" );
document.write( " \n" );
document.write( "
Algebra.Com's Answer #413300 by lynnlo(4176)![]() ![]() ![]() You can put this solution on YOUR website! TREE DIAGRAM \n" ); document.write( " D,S,U,X \n" ); document.write( " D,U,S,X \n" ); document.write( " D,X,U,S \n" ); document.write( " YOU CAN GET3X4=12 ARRANGEMENTS \n" ); document.write( " PUT THE LETTERS 3 DIFFERENT WAYS TIMES4 LETTERS=12 \n" ); document.write( " D,S,U,X \n" ); document.write( " D,U,X,S \n" ); document.write( " D,X,S,U==THIS IS AN EXAMPLE OF THE THE DIAGRAM \n" ); document.write( " |