Part 1: word to pattern a. for any given string of characters, return the pattern (we'll discuss in class). for example, the word "apple" may be represented as the patterns "abbcd" or "01123" or "12234" the word "zoozoo" may be "abbabb", "011011", "122122" b. the program should be able to take a string from console (typed word) or read words from a file part 2: pattern to word a. for a given string of characters representing a word pattern, return possible candidate words (take advantage of words_aplha. txt and you may want to create a new file) for example, the pattern "abbcd" will return a list of candidates as: apple essay reefs hooky leets wooly : likewise if a word is entered "apple" then the candidate list is also returned b. the program should be able to take a string from console (typed word) or read words from a file.