Find bigrams in the attached text. Bigrams are word pairs and their counts. To b

Find bigrams in the attached text. Bigrams are word pairs and their counts. To b

Find bigrams in the attached text. Bigrams are word pairs and their counts. To build them do the following:
Tokenize by word.
Create two almost-duplicate files of words, off by one line, using tail.
Paste them together so as to get word(i) and word(i +1) on the same line.
Count
Then, after you have the data from the procedure above: Provide the commands to find the 10 most common bigrams.
For the submission, provide all the commands that accomplishes the steps from 1. to 5.
After completing the above, go to following web page: NLTK :: nltk.lm package. First, implement the tutorial to develop an understanding of the library and its usage foo bigrams. Then, replicate all steps for the attached text.