(Solved): Monoalphabetic Substitution Ciphers - A-Z labeled as 1-26 How many solutions, counted as distinct el ...

How many solutions, counted as distinct elements of ${\mathbb{Z}}_{300}=\{0,1,\dots ,299\}$, does the congruence $84x\equiv 72(\mathrm{mod}300)$ have? Question 2 1 pts The equivalence $10x\equiv 4(\mathrm{mod}26)$ has two solutions. The smaller one is and the larger one is . (Here each answer should be a residue between 0 and 25 .) Question 3 $1\mathrm{pts}$ You have a text of 1750 characters of plaintext English. How many 'h' characters would you expect to have? (Round to the nearest integer.) Question 4 $1\mathrm{pts}$ You have a text of 155000 characters that has been encrypted from plaintext English using some MSC. You count that the character 'G' occurs 14103 times. What is the most likely plaintext character that corresponds to ' $G$ '? Question 5 $1\mathrm{pts}$ Suppose you have intercepted a text that you believe is encrypted with an affine cipher. Furthermore, you suspect that "the" has been encoded as "RZO". The multiplicative key must be and the additive key must be