Create a doubly linked list whose nodes contain Strings. Your list should include the following methods: Insert a node in the list in alphabetical order Find a node that matches a String Traverse the list forwards and print Traverse the list backwards and print Delete a node from the list Delete/destroy the list In addition to creating the class(es) for your linked list, you'll need to create a main method that thoroughly tests each function you build to show that it works. You should do these things in parallel, not save testing for the end. Here's a sense of how your workflow ought to go: Write a function, documenting it as you go. Write as many tests as you need in the main method to show that it works. Test both typical uses and atypical uses that might break it. Debug as necessary. Commit