Please do both parts in Python and print the output. Thank you. Problem 3. You are given the following text. In [ ]: M text = "It was dark, like the bottom of a well. There was a pattern of skulls and bones around I the frame, for the sake of appearances; Death could not look himself in the skull in a mirror I with cherubs and roses around it. The Death of Rats climbed the frame in a scrabble of claws and looked at Death expectantly from the top. Quoth fluttered over and pecked briefly at his own reflection, on the basis that anything was worth a try. Show me, said Death, show me my thoughts. A chessboard appeared, but it was triangular, and so big that only the nearest point could be seen. Right on this point was the world - turtle, elephants, the little orbiting sun and all. It was the I Discworld, which existed only just this side of total improbability and, therefore, in border country. I In border country the border gets crossed, and sometimes things creep into the universe that have I rather more on their mind than a better life for their children and a wonderful future in the fruit picking and domestic service industries. On every other black or white triangle of the chessboard, all the way to infinity, was a small grey shape, rather like an empty hooded robe." You are also given a string that contains all symbols of English alphabet. In [3]: M alphabet = "abcdefghijklmnopqrstuvwxyz" Part 1. Write some code that generates the list unique_words, containing all and only the unique lowercase words from text. You should see the following output (the order can differl): ['a', 'infinity', 'reflection', 'with', 'like', 'big', 'briefly', 'into', 'children', 'which', 'fruit', 'picking', 'ther e', 'try', 'little', 'around', 'appearances', 'appeared', 'all', 'crossed', 'basis', 'improbability', 'their', 'discworl d', 'black', 'to', 'death', 'future', 'only', 'my', 'robe', 'things', 'for', 'it', 'existed', 'said', 'sake', 'sometime s', 'right', 'way', 'that', 'country', 'chessboard', 'quoth', 'well', 'domestic', 'skull', 'wonderful', 'hooded', 'or', 'empty', 'bottom', 'mirror', 'himself', 'rather', 'over', 'every', 'triangle', 'roses', 'border', 'orbiting', 'Was', 'fr om', 'show', 'be', 'pecked', 'bones', 'just', 'universe', 'me', 'triangular', 'gets', 'worth', 'have', 'climbed', 'servi ce', 'fluttered', 'top', 'but', 'grey', 'claws', 'at', 'rats', 'creep', 'own', 'pattern', 'point', 'white', 'than', 'dar k', 'therefore', 'frame', 'this', 'not', 'the', 'could', 'mind', 'turtle', 'scrabble', 'better', 'industries', 'looked', 'an', 'cherubs', 'life', 'anything', 'more', 'small', 'and', 'of', 'his', 'on', 'sku1ls', 'elephants', 'in', 'thoughts', 'seen', 'nearest', 'expectantly', 'other', 'side', 'shape', 'total', 'so', 'world', 'look', 'sun'] In [ ]: M Part 2. Write a program which generates the list bigrams, collect all attested bigrams in Ignore words that are shorter than 2 characters. Make sure that the list bigrams does not contain duplicates. H.

1. Please do both parts in Python and print the output. Thank you.
Problem 3. You are given the following text. In [ ]: M text = "It was dark, like the bottom of a
well. There was a pattern of skulls and bones around I the frame, for the sake of appearances;
Death could not look himself in the skull in a mirror I with cherubs and roses around it. The
Death of Rats climbed the frame in a scrabble of claws and looked at Death expectantly from the
top. Quoth fluttered over and pecked briefly at his own reflection, on the basis that anything was
worth a try. Show me, said Death, show me my thoughts. A chessboard appeared, but it was
triangular, and so big that only the nearest point could be seen. Right on this point was the world
- turtle, elephants, the little orbiting sun and all. It was the I Discworld, which existed only just
this side of total improbability and, therefore, in border country. I In border country the border
gets crossed, and sometimes things creep into the universe that have I rather more on their mind
than a better life for their children and a wonderful future in the fruit picking and domestic
service industries. On every other black or white triangle of the chessboard, all the way to
infinity, was a small grey shape, rather like an empty hooded robe." You are also given a string
that contains all symbols of English alphabet. In [3]: M alphabet =
"abcdefghijklmnopqrstuvwxyz" Part 1. Write some code that generates the list unique_words,
containing all and only the unique lowercase words from text. You should see the following
output (the order can differl): ['a', 'infinity', 'reflection', 'with', 'like', 'big', 'briefly', 'into',
'children', 'which', 'fruit', 'picking', 'ther e', 'try', 'little', 'around', 'appearances', 'appeared', 'all',
'crossed', 'basis', 'improbability', 'their', 'discworl d', 'black', 'to', 'death', 'future', 'only', 'my', 'robe',
'things', 'for', 'it', 'existed', 'said', 'sake', 'sometime s', 'right', 'way', 'that', 'country', 'chessboard',
'quoth', 'well', 'domestic', 'skull', 'wonderful', 'hooded', 'or', 'empty', 'bottom', 'mirror', 'himself',
'rather', 'over', 'every', 'triangle', 'roses', 'border', 'orbiting', 'Was', 'fr om', 'show', 'be', 'pecked',
'bones', 'just', 'universe', 'me', 'triangular', 'gets', 'worth', 'have', 'climbed', 'servi ce', 'fluttered',
'top', 'but', 'grey', 'claws', 'at', 'rats', 'creep', 'own', 'pattern', 'point', 'white', 'than', 'dar k', 'therefore',
'frame', 'this', 'not', 'the', 'could', 'mind', 'turtle', 'scrabble', 'better', 'industries', 'looked', 'an',
'cherubs', 'life', 'anything', 'more', 'small', 'and', 'of', 'his', 'on', 'sku1ls', 'elephants', 'in', 'thoughts',
'seen', 'nearest', 'expectantly', 'other', 'side', 'shape', 'total', 'so', 'world', 'look', 'sun'] In [ ]: M Part
2. Write a program which generates the list bigrams, collect all attested bigrams in Ignore words
that are shorter than 2 characters. Make sure that the list bigrams does not contain duplicates.
Hint. You can use the code to extract bigrams you wrote above. Then, you need to have that code
iterate over each word in the list and add a check for duplicates! In [ ]: M