C++ CODING HELP

Here is the drop box link that contains all the files needed for the project. the only one that needs work is the header file and I have marked in the program on what exactly I need help filling out.

https://www.dropbox.com/sh/5m4luzjlcsxkm9q/AAAVJreGcupi4mFS0Vbk2RGTa?dl=0

Here is the instructions

Introduction The Standard Library provides sets, multisets, maps, and multimaps, which are all typically implemented as balanced binary search trees. Maps and multimaps are associative containers, that associate a key with a value. Multimaps are different from maps in that they allow multiple values for a given key.

Concordance A concordance is an alphabetical list of the words in a text, with citations of the passages concerned. It is more useful if the words are first sorted by length, then alphabetically. Here is a sample output of the program you will write (analyzing the Gettysburg Address). (Compare it to your own writing.) //------------------------------------ // 7 LETTER WORDS //------------------------------------ brought: 1 created: 1 detract: 5 engaged: 3 fathers: 1 fitting: 3 freedom: 5 honored: 5 liberty: 1 measure: 5 portion: 3 resolve: 5 resting: 3 testing: 3 whether: 3 ... 15 words with size: 7 //------------------------------------ // 8 LETTER WORDS //------------------------------------ advanced: 5 dedicate: 3 5 devotion: 5 remember: 5 ... 4 words with size: 8 //------------------------------------ // 9 LETTER WORDS //------------------------------------ conceived: 1 3 continent: 1 dedicated: 1 3 5 increased: 5 remaining: 5 struggled: 5 ... 6 words with size: 9 //------------------------------------ // 10 LETTER WORDS //------------------------------------ altogether: 3 consecrate: 5 government: 5 unfinished: 5 ... 4 words with size: 10 ... //------------------------------------ // WORD LENGTH DISTRO Len: 1 -- 1 word Len: 2 -- 15 words Len: 3 -- 23 words Len: 4 -- 24 words Len: 5 -- 28 words Len: 6 -- 16 words Len: 7 -- 15 words Len: 8 -- 4 words Len: 9 -- 6 words Len: 10 -- 4 words The numbers next to each word indicate the line numbers at which the word was found.

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), and a vector (std::vector). The StringLenCmp class is provided. The vector counts how many unique words of each length occurred (it doesnt 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 Sorcerors 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.