Write a program that allows the user to enter a string. It then prints a
table of the letters of the alphabet in alphabetical order which occur in
the string together with the number of times each letter occurs. Case should
be ignored. A sample run of the program might look this this:

Give the Python interpreter’s response to each of the following from a
continuous interpreter session:

>>> d={'apples':15,'bananas':35,'grapes':12}>>> d['banana']

>>> d['oranges']=20>>> len(d)

>>> 'grapes'ind

>>> d['pears']

>>> d.get('pears',0)

>>> fruits=d.keys()>>> fruits.sort()>>> print(fruits)

>>> deld['apples']>>> 'apples'ind

Be sure you understand why you get each result. Then apply what you
have learned to fill in the body of the function below, and add code for
the tests indicated:

Write a program called alice_words.py that creates a text file named
alice_words.txt containing an alphabetical listing of all the words, and the
number of times each occurs, in the text version of Alice’s Adventures in Wonderland.
(You can obtain a free plain text version of the book, along with many others, from
http://www.gutenberg.org.) The first 10 lines of your output file should look
something like this

Word

Count

a

631

a-piece

1

abide

1

able

1

about

94

above

3

absence

1

absurd

2

How many times does the word, alice, occur in the book? If you are writing this
in the activecode window simply print out the results rather than write them to a file.