Java code

Standard telephone keypads contain the digits zero through nine. The numbers two through nine each have 3~4 letters (case insensitive) associated with them. Many people find it difficult to memorize phone numbers, so they use the correspondence between digits and letters to develop seven-letter words that correspond to their phone numbers. For example, a person whose telephone number is 686-2377 might remember it as "NUMBERS."

 Digit Letters 

2 ABC 3 DEF 4 GHI 5 JKL 6 MNO 7 PQRS 8 TUV

9 WXYZ

Each seven-letter word corresponds to exactly one seven-digit telephone number, but a seven-digit number corresponds to many seven-letter strings, most of which are not words.

Create a Project2 class under the project package.

In this project you will develop a program which will find all the corresponding English

words given any specific telephone number. Here are the detailed requirements:

In the Project2 class you will create a static void test() method.

The test method will first ask the user to type in through keyboard a 7-digit telephone

number.

If the number typed in by the user is not 7 digits or the number contains some number

of the digit 0 or 1, then your program reports an error and asks to type in another

number.

Use binary search to search through the list in the file and match with the 7 letter words the numbers correspond to.

If the number typed in by the user is a 7-digit telephone number made up of the digits

2 through 9, then your program will print out all the English words corresponding to the telephone number (and the total number of them), using the given English word library in the COSC240_P2_EnglishWordList.txt.

Word List:

abandon

blossom

cancans

cappella

intrude