Help finish c++ Concordance Class using MultiMap

Need this to be done within 12 hours! Help finish the last four functions in my header file that I will provide. Objective You are given a partial implementation of a concordance class. It contains the class declaration, the minimum and maximum length of words to analyze (e.g., from 4 letter words to 12 letter words), a multimap (std::multimap<std::string, size_t, StringLenCmp>), and a vector (std::vector<size_t>). The StringLenCmp class is provided. The vector counts how many unique words of each length occurred (it doesn’t count the number of times that word occurred). The Comparator class only defines operator(), sometimes called the function call operator. As you can see from the code, its only job is to tell the multimap to sort the entries first by word length, then alphabetically. Nothing to it! Your job is to complete the concordance class (concordance.h), so that it correctly calculates the number of words in three separate pieces of text, all from the book: Harry Potter and the Sorceror’s Stone. The first piece of text is the first paragraph from the book. The second piece is the first page (and a bit more to finish the paragraph). The last piece is the entire first chapter from the book. Source Code Files You are given “skeleton” code files with declarations that may be incomplete and without any implementation. Implement the code and ensure that all the tests in [login to view URL] pass successfully. concordance.h: This is to be completed Note: the functions to read from a file and split a line into words is already given to you. You need to implement the remaining 4 public member functions.