Suppose Alice starts with a plaintext message and encrypts it using a Csar cipher with a shift of k letters. Since she is also just learning about cryptography at the moment, she explores what happens when she encrypts the encrypted ciphertext, using the same shift of k. She does this repeatedly, and eventually she finds that she has decrypted the message. In terms of k, how many times did Alice have to encrypt the message before it became decrypted? (You may assume that the message is in English this time, so that the alphabet has 26 letters.)