Patrick is using an affine cipher to send messages to Spongebob in a boring crypto class. He ends each message with hah (before encrypting). If you intercept his cipher-text and see that it's (17,5, 0, 29, 33, 5, 0, 20, 16, 19, 19, 5, 5, 4, 35, 4), what was his affine map? What was his message? (You may assume he converted letters to numbers as in Problem 1, before he applied his affine cipher.) Hint: If you assume his map was f(x) = ax + 3, the last 2 numbers give you an easy way to solve for a and 3 mod 43. space apostrophe, dash 0 1 2 3 4 5 6 7 8 9 abcdefghijklmnop qrstuvwxyz 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 2 1.1