document.write( "Question 338550: Z W Y X
\n" ); document.write( "The sequence above may be changed in either of two ways. Either two adjacent letters may be interchanged or the entire sequence may be reversed. What is the least number of such changes needed to put the letters into alphabetical order left to right?\r
\n" ); document.write( "\n" ); document.write( "A. 2 B. 3 C. 4 D. 5 E. 6 \n" ); document.write( "
Algebra.Com's Answer #242679 by Edwin McCravy(20056)\"\" \"About 
You can put this solution on YOUR website!
\r\n" );
document.write( "ZWYX\r\n" );
document.write( "\r\n" );
document.write( "We cannot do it in only two changes because these\r\n" );
document.write( "\r\n" );
document.write( "WZYX, ZYWX, ZWXY, XYWZ \r\n" );
document.write( "\r\n" );
document.write( "are the only possible results after one change, and the \r\n" );
document.write( "final result of WXYZ cannot be obtained from any of these \r\n" );
document.write( "in only one additional change.\r\n" );
document.write( "\r\n" );
document.write( "However we can change ZYWX to ZYXW to WXYZ,\r\n" );
document.write( "\r\n" );
document.write( "or\r\n" );
document.write( "\r\n" );
document.write( "we can change XYWZ to XWYZ to WXYZ.\r\n" );
document.write( "\r\n" );
document.write( "So the least number of changes possible is 3.\r\n" );
document.write( "\r\n" );
document.write( "Edwin
\n" ); document.write( "
\n" );