im having trouble writing this assignment in Python specifically, and where to start. its part of the assignment to also explain what is going on throughout the program.

Jean-Taillfer \& Pierre-Wacozyk cryptosystem is defined as follows: 1. Keys are 16-bit values. 2. Messages are strings with an even number of characters. If the input string is odd, add a blank at the end of the string. 3. The encryption of a message M of length n (in bytes) is given by: EK(M)=M(KK). where the key K is repeated n/2 times. 4. The decryption algorithm for a ciphertext C is the same as the encryption algorithm: D2(M)=M(KK). 1. (5 points) implement the cryptosystem above to encrypt and decrypt a file for a given 2 character key. 2. (5 points) Implement a brute-force decryption attack for this cryptosystem. 3. (5 points) Write a short and concise report (two pages maximum) on your brute force algorithm that explains how it decrypt the message with brute force. Don't forget to include short examples to hackun your claim. The idea of the report is to provide an overview of your algorithm and the program without having to go through the source code. quirements \& Dellverables: 1. You are to work alone but you can discuss the problem with your classmates. 2. Your program must consist of a single Python file. 3. A test text file and dictionary is available at Mypoline, 4. Use two characters for the key (instead of a long binary string of 0 s and 1s). 5. The program must have a menu with three ontian (TUI): a. Enter the filename and key to encrypt b. Enter the filename and key to decrypt c. Enter the filename to brute force (print the key to the screen and the decrypted text to a file) 6. We will run your program so be sure to provide detailed instructions and to comment the code sufficiently. Source code(s) without proper comments will recelve 1010 points. Remember, proper comments I = over commenting. 7. Note: if you are using pure brute force with a large dictionary, it may pt without a key. Make sure that you write your program efficiently enough so tha. more than five minutes to crack a file. 8. Prof. Thompson claimed that he wrote the fastest brute force algorithm. Can y. me is based from when the encoded file is read until the decoded file is printed to screen, diction aaded