Q$3)$ Show that the shift $($Caesar$)$ and substitution ciphers are all trivial to break using a chose$-$plaintext attack. How much chosen plaintext is needed to recover the key for each of the cipher? You can assume that the plaintext contains only lowercase English letters.