PLEASE CODE IN JAVA NEED IT ASAP

Programming Challenge Descriptiorn IBM is implementing an online pharmacy application for a major drug store chain. As part of the application, customers can start to type in the name of a drug and the system will allow them to choose from among the list of drugs which begins with the letters that they have typed. For example, if they type the letters "ASP", the system could offer "ASPRIN" as a possible match, along with other drugs that begin with "ASP". If there's no match, the system will show NONE> Assumptions . The list may be very long, hundreds of thousands of drugs . The call will be made very often, so search speed is crucial. Assume that in the production version, whatever preprocessing you do on the list of drugs is only done once, and the search is the only part that is called repeatedly Input: The entire list of drugs in alphabetical order, followed by a blank line, and then a partial sequence to search for Output The first 2 matching drugs, one per line, or if there's no match Test 1 Test Input B ACETAMINOPHEN ASPERGEL ASPRIN ASPERTAME ATAVAN