Part Two: Implementing a rainbow tableYou are to write a program, in C/C++, Java or Python, that should run using the following instruction:$ ./Rainbow Passwords.txtwhere the file Passwords.txt contains a list of possible passwords. The password file contains a passwordper line, as in the provided words file and consists of strings of printable characters. Any password usedmust be taken from this file, so the only stored hash information needs to relate to those entries in the file.The program is used to find pre-images for given hash values. Rainbow tables can be used to solvepre-image problems for hash functions. At the simplest level they can simply be a list of hash valuesand the corresponding pre-images, often from some dictionary. This can be expensive in terms of storagespace however, and a more efficient way of identifying pre-images involves the use of the hash functionand reduction functions.First stepThe process is as follows:1. Read in the list of possible passwords. Report on the number of words read in.2. For each previously unused word W, first mark it as used and then carry out the following process,: Your program will do some initial computations to generate the rainbow table.(a) Apply the hash function H to the word W to produce a hash value H(W), which we refer toas the current hash.(b) Apply the reduction function R to the current hash, which will give a different possible passwordwhich should be marked as used and then hashed. The resulting hash value is recorded as thecurrent hash.(c) Repeat the previous step four times. You can deal with collisions if you like but are not requiredto.(d) Store the original word W and the final current hash as an entry in your rainbow table.3. To assist with the later identification of the pre-images you should sort the rainbow table based onthe hash values24. Output the list of words and corresponding "final current hashes" to a text file Rainbow. txt. Reportto standard out the number of lines in your rainbow table (Second StepYou are now ready to carry out the second part of the exercise, finding pre-images. Request a hash value from the user. There should be appropriate error checking as to the lengthof the input string etc. The process of identifying the pre-image for the provided hash value is sketchedas follows:1. Check if the hash value is in the rainbow table2. If the hash value isn't in the rainbow table you reduce and hash until you get a hash value that is inthe rainbow table, or until you have done the reduce and hash enough times that it's clear from theway the rainbow table is generated that something is wrong. Display an appropriate message if thishappens3. Once you have identified the relevant hash value in the table you take the corresponding passwordand hash it. If that is your hash value you have your pre-image. If it isn't, then reduce and hashagain, until the reduced word hashes to the hash value being searched for4. Output the releative reduced word, that is your pre-imageA reduction function is designed to take a valid hash value and return a valid password, in this casevalid word from Passwords.txt. The reduction function to be used should be based on the number ofwords in the Passwords.txt file, and since that isn't a fixed length file your method needs to be dynamic.You should find a way to convert a hash value to an integer that identifies one of the passwords. Youcan define yourself a reduction function R or find some examples online. You should describe how yourreduction function works in readme.txt.You should use MD5 as the hash function. You don't need to implement the MD5 hash function byyourself. You can find such a file online. Provide a reference if you use any open source implementation.

Question

Part Two: Implementing a rainbow tableYou are to write a program, in C/C++, Java or Python, that should run using the following instruction:$ ./Rainbow Passwords.txtwhere the file Passwords.txt contains a list of possible passwords. The password file contains a passwordper line, as in the provided words file and consists of strings of printable characters. Any password usedmust be taken from this file, so the only stored hash information needs to relate to those entries in the file.The program is used to find pre-images for given hash values. Rainbow tables can be used to solvepre-image problems for hash functions. At the simplest level they can simply be a list of hash valuesand the corresponding pre-images, often from some dictionary. This can be expensive in terms of storagespace however, and a more efficient way of identifying pre-images involves the use of the hash functionand reduction functions.First stepThe process is as follows:1. Read in the list of possible passwords. Report on the number of words read in.2. For each previously unused word W, first mark it as used and then carry out the following process,: Your program will do some initial computations to generate the rainbow table.(a) Apply the hash function H to the word W to produce a hash value H(W), which we refer toas the current hash.(b) Apply the reduction function R to the current hash, which will give a different possible passwordwhich should be marked as used and then hashed. The resulting hash value is recorded as thecurrent hash.(c) Repeat the previous step four times. You can deal with collisions if you like but are not requiredto.(d) Store the original word W and the final current hash as an entry in your rainbow table.3. To assist with the later identification of the pre-images you should sort the rainbow table based onthe hash values24. Output the list of words and corresponding &#34;final current hashes&#34; to a text file Rainbow. txt. Reportto standard out the number of lines in your rainbow table (Second StepYou are now ready to carry out the second part of the exercise, finding pre-images. Request a hash value from the user. There should be appropriate error checking as to the lengthof the input string etc. The process of identifying the pre-image for the provided hash value is sketchedas follows:1. Check if the hash value is in the rainbow table2. If the hash value isn't in the rainbow table you reduce and hash until you get a hash value that is inthe rainbow table, or until you have done the reduce and hash enough times that it's clear from theway the rainbow table is generated that something is wrong. Display an appropriate message if thishappens3. Once you have identified the relevant hash value in the table you take the corresponding passwordand hash it. If that is your hash value you have your pre-image. If it isn't, then reduce and hashagain, until the reduced word hashes to the hash value being searched for4. Output the releative reduced word, that is your pre-imageA reduction function is designed to take a valid hash value and return a valid password, in this casevalid word from Passwords.txt. The reduction function to be used should be based on the number ofwords in the Passwords.txt file, and since that isn't a fixed length file your method needs to be dynamic.You should find a way to convert a hash value to an integer that identifies one of the passwords. Youcan define yourself a reduction function R or find some examples online. You should describe how yourreduction function works in readme.txt.You should use MD5 as the hash function. You don't need to implement the MD5 hash function byyourself. You can find such a file online. Provide a reference if you use any open source implementation.

Accepted Answer

Look at the next step for the coding