Using DEV C++

#include

use c-style string do not use char arrays

Background: Text messaging on cell phones is sometimes configured so that when the user types a sequence of number keys, possible words appear. The numbers on the keypad correspond to the following letters 1 ABC I DEF GHI JKL MNO 2- abc 3- def 4 PQRS TUV IWXYZ 8 -mno - parS 8- tuv 9 - wxyz For example, if the user enters the sequence 368253 the word "double" should appear However, if the user enters the sequence 4663, several possible words could be formed, including "home" "good" "gone", "hood", "hone", "hoof", and "goof." The user might be given a way to select from this list of potential words. To keep this assignment from becoming too complicated, we will avoid punctuation and special symbols. US Dictiona A text file named provi words representing the English language. This dictionary is not arranged like most dictionaries, but instead lists words as follows Dictionary.txt is provided on the instructor's web page. This file contains over 118,000 All 1-letter words (in alphabetical order) All 2-letter words (in alphabetical order) All 3-letter words (in alphabetical order) - Etc Program Description Write a C++ program that begins by giving the user three options 1) Enter a word and convert it to a sequence of numbers (this should be easy!) Example: User input: Buffalo Output: 2833256 2) Enter a sequence of numbers and display a list of all possible words in USDictionary.txt that match. Note that since the longest word in USDictionary.txt is 45 letters in length, the input number sequence must be a string (since no integers in C++ can handle 45 digits) Example 1: User input 368253 double Output: no parentheses are needed if there is only one word that matches 4663 (good, gone, hood, hone, hoof, good) Example 2: User input Output: use parentheses and separate the possible words by commas if two or more words match Background: Text messaging on cell phones is sometimes configured so that when the user types a sequence of number keys, possible words appear. The numbers on the keypad correspond to the following letters 1 ABC I DEF GHI JKL MNO 2- abc 3- def 4 PQRS TUV IWXYZ 8 -mno - parS 8- tuv 9 - wxyz For example, if the user enters the sequence 368253 the word "double" should appear However, if the user enters the sequence 4663, several possible words could be formed, including "home" "good" "gone", "hood", "hone", "hoof", and "goof." The user might be given a way to select from this list of potential words. To keep this assignment from becoming too complicated, we will avoid punctuation and special symbols. US Dictiona A text file named provi words representing the English language. This dictionary is not arranged like most dictionaries, but instead lists words as follows Dictionary.txt is provided on the instructor's web page. This file contains over 118,000 All 1-letter words (in alphabetical order) All 2-letter words (in alphabetical order) All 3-letter words (in alphabetical order) - Etc Program Description Write a C++ program that begins by giving the user three options 1) Enter a word and convert it to a sequence of numbers (this should be easy!) Example: User input: Buffalo Output: 2833256 2) Enter a sequence of numbers and display a list of all possible words in USDictionary.txt that match. Note that since the longest word in USDictionary.txt is 45 letters in length, the input number sequence must be a string (since no integers in C++ can handle 45 digits) Example 1: User input 368253 double Output: no parentheses are needed if there is only one word that matches 4663 (good, gone, hood, hone, hoof, good) Example 2: User input Output: use parentheses and separate the possible words by commas if two or more words match