1.Define a function which creates a dictionary where the keys are between the letters a and h, inclusive, and the values are square of keys ordinal value (Hint: check an ASCII table). The function should return the dictionary back to the caller.

-Using the returned dictionary from your function, print the entire dictionary.

-Using the returned dictionary from your function, print only the values of the dictionary.

-Using the returned dictionary from your function, print only the keys of the dictionary.

2. Write a program, using Python dictionaries, that analyzes text documents and counts how many times each word appears in the document. This kind of analysis is some- times used as a crude measure of the style similarity between two documents and is also used by automatic indexing and archiving programs (such as Internet search engines). At the highest level, this is just a multi-accumulator problem. We need a count for each word that appears in the document.