Question: Given this premise and the fact the English language has a $26-$letter alphabet, what length message is needed to show that the Shannon theorem is violated, i$.$e$.|$K$|<|$M$|$ for a monoalphabetic cipher and why?