Java or python

NEED HELP SOLVING WITHOUT KNOWING THE SHIFT/KEY

1) Cracking shift ciphers Recall from the lecture slides that a shift cipher shifts letters in the alphabet by a fixed number of positions to encrypt a message. As an example, a shift cipher using 3 as a shift value uses the following transformations to encrypt: You will implement a cracker that decrypts any type of shift cipher without knowing the shift / key. You can assume use of only the plaintext alphabet above (only lowercase letters). For a given cipher text, your program will find the probable plain text message, using heuristics and methods you decide. Your program should output the most probable (according to your heuristics) decrypted plain text given an input of a standard length paragraph of ciphertext