Problem 2. (Sorting Strings) Hints: Create a deque d For each word w read from standard input Add w to the front of d if it is less than the first word in d Add w to the back of d if it is greater than the last word in d Otherwise, remove words that are less than w from the front of d and store them in a temporary stack s; add w to the front of d; and add words from also to the front of d Write the words from d to standard output Use the helper method boolean less (String v, String w) to test if a string v is less than a string w import stdlib.StdIn; import stdlib.Stdout; public class Sort { // Entry point. public static void main(String[] args) { static Deque d; // store oder - } - // Returns true if v is less than w according to their lexicographic order, and false otherwise. private static boolean less (String v, String w) { return v.compareTo(w) - */workspace/project2 $ java Sort ABRACADABRA A A A A B B D R R