According to wikipedia, the longest word in the English language is , which has 45 characters. On the other end of the scale, there are many words in English that are made up of a single character. Consider a list of NEnglish words (stored as Strings), and describe an algorithm that sorts the words by length. You can assume that getting the length of a String is an O(1) operation and that wikipedia is correct and the longest word is 45 characters long. Your algorithm should be O(N) in the worst case. Analyze your algorithm for space and runtime. Do not write pseudocode and do not reference any algorithms or data structures that have not yet been covered in this class.

File account.java (see previous exercise) contains a definition for a simple bank account class with methods to withdraw, deposit, get the balance and account number, and return a string representation. note that the constructor for this class creates a random account number. save this class to your directory and study it to see how it works. then write the following additional code: 1. suppose the bank wants to keep track of how many accounts exist. a. declare a private static integer variable numaccounts to hold this value. like all instance and static variables, it will be initialized (to 0, since it’s an int) automatically. b. add code to the constructor to increment this variable every time an account is created. c. add a static method getnumaccounts that returns the total number of accounts. think about why this method should be static - its information is not related to any particular account. d. file testaccounts1.java contains a simple program that creates the specified number of bank accounts then uses the getnumaccounts method to find how many accounts were created. save it to your directory, then use it to test your modified account class.