$2\mathrm{.}11\mathrm{.}2$: Print two strings in alphabetical order.

Print the two strings, firstString and secondString$,$ in alphabetical order. Assume the strings are lowercase. End with newline.

Sample output:

capes rabbits

Learn how our autograder works

$546242\mathrm{.}2877792.$qx$3$zqy$7$

secondString $=$ scnr$.$ next$()$;

firstString$=$"rabbits";

secondString$=$"capes";

if $($firstString$.$compareTo$($secondString$)<mtext\; id="EditorElement\_194152"></mtext><mn\; id="EditorElement\_194153">0</mn><mi\; id="EditorElement\_194154">)</mi>$

$\{$

System.out.println$($firstString $+""+$ secondString$)$;

$\}$

else

$\{$

System.out.println$($secondString $+""+$ firstString$)$;

$\}$

$23$

$243$

$25$

$$ Not all tests passed

$$ Testing input rabbits capes

Your output

$$ Testing input capes rabbits

Your output

$x$ Testing input clearly clear

Output differs. See highlights below.

Your output

Expected output

$x$ Testing input wand wand

Output differs. See highlights below.

Your output

Expected output