In this assignment, we will implement some methods for lists of words. Some of these may be relevant to the later game assignment, others are for practice.

All of the following methods should be defined in ILoWord. You may need to design helpers for some of the methods as well.

When referring to strings, this is known as a $$case$-$insensitive$$ sort, since when it examines two strings, it converts everything to lowercase $($or uppercase $$ would it make any difference?$)$ before comparing them, so the comparison can$$t use$$or be sensitive to$$differences in casing.

Design the method sort that produces a new list, with words sorted in alphabetical order, treating all Strings as if they were given in all lowercase. You may use insertion sort as we did in lecture.

Note: The String class defines the method toLowerCase that produces a String just like the one that invoked the method, but with all uppercase letters converted to lowercase.

Design the method isSorted that determines whether this list of IWords has words sorted in alphabetical order, in a case$-$insensitive way.