In the project you will find skeleton functions and a class all of which you must implement per the comments in the file.

Some handy word lists (files containing 1 word per line):

• Some Scrable word lists
  • http://www.puzzlers.org/pub/wordlists/ospd.txt (Links to an external site.)
  • http://www.puzzlers.org/pub/wordlists/enable1.txt (Links to an external site.)
  • http://www.puzzlers.org/pub/wordlists/web2.txt (Links to an external site.) (Links to an external site.)
• The 500 Worst Passwords (note some of these contain only numbers and so are not great for use with the gematria parts).
  • https://raw.githubusercontent.com/danielmiessler/SecLists/master/Passwords/500-worst-passwords.txt

 ATTACHMENT PREVIEW Download attachment

#include <iostream>#include <vector>using namespace std;/*** Returns the count of the number of vowels (including y).* Note: It must handle both upper- and lower-case.** @param word the word whose vowels need counting.** @return the count of the number of vowels (including y).*/int vowel_count(string word) {// TODO: insert your implementation}/*** Returns the number of syllables in a word.* To make this simple, use the following rules:*Each group of adjacent vowels (a, e, i, o, u, y)*counts as one syllable*(for example, the “ea” in “real” contributes one syllable,*but the “e ... a” in “regal” counts as two syllables).*However, an “e” at the end of a word doesn’t count as a*syllable. Also each word has at least one syllable,*even if the previous rules give a count of 0.** For example:*syllable_count("Harry") returns 2*syllable_count("hairy") returns 2*syllable_count("hare")returns 1*syllable_count("the")returns 1** @param word the word whose syllables to count** @return the number of syllables in a word.*/int syllable_count(string word) {// TODO: insert your implementation}/*** Given a file that contains 1 word per line, returns* a vector of all the words that have min <= length <= max.** @param filename name of a file with 1 word per line.* @param min the min length (inclusive).* @param max the max lenght (inclusive).** @return a vector of all the words that have min <= length <= max,*if none match, an empty vector is returned.*/vector<string> filter_dict(string filename, int min, int max) {// TODO: insert your implementation}class GematricString {private:/*** The original word (case-preserved)*/string word;