A MonoAlphabetic Substitution Cipher maps individual plaintext letters to individual ciphertext letters, on a 1-to-1 unique basis. That is, every instance of a given letter always maps to the same ciphertext letter.

The oldest such cipher known is the Caesar cipher, where the mapping involved a simple shift within the alphabet. For example, the following represents a Caesar cipher with a shift of 3:

Plaintext: ABCDEFGHIJKLMNOPQRSTUVWXYZ 

Ciphertext: XYZABCDEFGHIJKLMNOPQRSTUVW

Question 1: Here's the ciphertext for a message enciphered in the same way as above: Jgesfk mkwv lzak wfujqhlagf ewlzgv af Uwsksj'k osjk.

What is the plaintext for this message

Question 2: Given the approach described above, for a Shift Substitution Cipher, how many possibilities are there for a shift value? Is this a feasible task?

Question 3: Given the approach described above, for a MonoAlphabetic Substitution cipher, how many possibilities are there for character mappings? Is this a feasible task?