PROGRAM MUST BE WRITTEN IN PYTHON

For this project you will implement a proactive password checker as a simplified Bloom filter At the time the program starts running initially, you will read in an initial password dictionary (in a file called dictionary.txt) that will consist of 10 words. After reading the dictionary, you will look at potential new passwords in a loop, until the password is accepted, as follows: Enter new password: The password you just entered is unacceptable, enter new password: (finally when you do enter an acceptable new password, it will say: ) Your password has been changed. In your simplified Bloom filter, you will use only ONE hash function, that you will write yourself. This hash function will work as follows: you will turn each character in a password string into its numeric (ASCII) code, and add up all the ASCII codes of the string to form the hash value (modulo table size, table size will be 13). You will use linear probing for collisions in your hash function. YOUR HASH TABLE WILL HAVE 13 ENTRIES. You will assume your input (and your password dictionary) will be only uppercase letters, better passwords would have other characters but we'll make this assumption for simplicity. Just throw away anything that isn't an uppercase alphabetic character