2. (2 pts.) Consider the RSA encryption system. Suppose m= 943 and e= (a) Factor 943. (b) Compute (943). 17. (c) Use the reversal of the Euclidean Algorithm procedure to find the decoding factor d. Note: All details must be shown to receive credit. And remember to adjust appropri- ately if the resulting "d" is negative. (d) Compute e((m))-1 mod (m). Technology may be used. Do you get the same answer as in part (c)? (e) Used to decode the following 5 numbers: 686, 652, 309, 787, 625 (f) Using the system A - 01, B - 02, ..., translate the resulting numbers into letters. What does it spell?