Do it in C++

The .txt file contains:

As the tension of the Cold War is peaking in 1973, George Smiley, former senior official in Britain's Secret Intelligence Service (known as "the Circus" because its London office is at Cambridge Circus), is living unhappily in forced retirement, following the failure of an operation codenamed Testify in Czechoslovakia which ended in the capture and torture of agent Jim Prideaux. Control, chief of the Circus, had suspected that one of the five senior intelligence officers at the Circus was a Soviet mole, and had assigned them code names for Prideaux to relay back to the Circus, derived from the English children's rhyme "Tinker, Tailor". Called out of retirement to settle the affairs of a friend, George Smiley finds his old organization, the Circus, so overwhelmed by political considerations that it doesn't want to know what happened. He begins to follow up the clues of his friends past days, discovering that the clues lead to a high person in the Russian Secret Service, and a secret important enough to kill for. Smiley continues to put together the pieces a step ahead or a step behind the Russian killers. #

2..(25 pts) Write a program that does the following steps: - Reads all the words in the "Smiley.txt" file and stores them in multimap& size) of Novel - Finds the longest word in Novel and stores it in int WrdLongest - Creates a vector Histogram(WrdLongest, 0) that contains the total number of words of size 1,2,3,4, Wrdlongest - Print the Histogram vector - Print all the words in Novel that are longer than 10 letters