You'll be breaking several shift ciphers in this problem. You'll be allowed

different tools for the different texts, ranging from a by hand solution, to an automated solution.

For each problem, determine the original plaintext, and the shift used to encrypt it$.$

a$)[8$pt$]$ Solve this problem by hand $($you can write the solution in a text editor, but don't use

alphabet$-$strips to shift around, that'll be part b$).$ Include a screenshot of your solution.

NWLHL UXYNM RJ

b$)[8]$ For this problem, use strips each consisting of two standard alphabets $($horizontally or

vertically$).$ You can print them, or work with them in a text$-$editor $($as we did$),$ or even use the

powerpoint implementation we saw in class $($available on d$2$l$).$ Text editor version is probably

easiest. Include a screenshot showing the strips.

YZXGD IZVIY AVGG

Note: you don't need a strip for every letter, once you have the shift you can decrypt by group. So

about $5$ strips should be enough.

c$)[8$pt$]$ Use the Caesar cipher spreadsheet we saw in class $($available on d$2$l$)$ to find the correct

solution. Fill in the ciphertext, hit "analyze ciphertext", and then try all different shifts, looking

for the shift that's closest to English. Include a screenshot $($just the relevant parts showing the

shift and the sum$).$

LXVKX VRHGV XTVVX IMXWU XVHFX LTGTW WBVMB HG

Note: You need to enable macros for the spreadsheet to work. If you cannot run the spreadsheet

on your computer or on a lab computer, use the method from b$)$ instead.