Let Set A $=\{$the quick brown fox jumped over the lazy dog$\}$ be a set of strings$($two or more characters$)$ formed by characters$($single letters$)$ in the standard alphabet

Enumerate $($assign numbers to the alphabet as$..$ A $=0->$ Z $=25$

With the Encrypt$($set$)..$Defined f$($x$)=$ x$+13$ mod $26,$ Now $$x in characters of A$,$ if X $=14$ mod $26,$ then x $->$ f$($x$)$ if not $,$ then x $->$ x

What is the overall effect of the encrypt$()$ algorithm $/$ what effect does this algorithm have on the alphabet. $*$bonus write the coded message.