Find the following:

a$)$ n $=$Answer for part $1$

$$

b$)==$ Answer for part $2$

c$)$ Find$$ ee$,$ the lowest in$[11,13,15,17,...][11,13,15,17,...]$ such that$$ gcd$($e$,)=1$gcd$($e$,)=1$

$1)$ Public key is $[$e$,$n$]$: $$e$=$e$=$Answer field $1$ for part $3$

$$

$2)$ Private key is $[$d$,$n$]$: $$d$=$d$=$ Answer field $2$ for part $3$

$$

d$)$ Ciphered Codes:Answer field $1$ for part $4$

$,$ Answer field $2$ for part $4$

$,$ Answer field $3$ for part $4$

$,$ Answer field $4$ for part $4$

e$)$ Deciphered CODE $=$Answer field $1$ for part $5$

Answer field $2$ for part $5$

Answer field $3$ for part $5$

Answer field $4$ for part $5$

f$)$ Deciphered Text:Answer field $1$ for part $60123456789$:;$<=>?$@ABCDEFGHIJKLMNOPQRSTUVWXYZ$[\backslash ]^\_`$abcdefghijklmnopqrstuvwxyz$\{|\}$Answer field $2$ for part $60123456789$:;$<=>?$@ABCDEFGHIJKLMNOPQRSTUVWXYZ$[\backslash ]^\_`$abcdefghijklmnopqrstuvwxyz$\{|\}$:Answer field $3$ for part $60123456789$:;$<=>?$@ABCDEFGHIJKLMNOPQRSTUVWXYZ$[\backslash ]^\_`$abcdefghijklmnopqrstuvwxyz$\{|\}$Answer field $4$ for part $60123456789$:;$<=>?$@ABCDEFGHIJKLMNOPQRSTUVWXYZ$[\backslash ]^\_`$abcdefghijklmnopqrstuvwxyz$\{|\}$