Part $1,$ can you undo the encoding process if you knowthe rotation? Here, we find the letter in the rotated alphabet and decode it to the letter in the normal alphabet $($the opposite for what we did for encoding$).$

$$

Part $2,$ you need to perform Part $1$ above on rotations of $1$ to $25.$ If the decoded string contains $($remember the in operator$)$ the target string provided $($test$),$ this must be the correct decoding. Remember the rotation and output the rotation and the decoded string.

$$

$1.$ If you go through $1-25$ rotations and the target string is not found, then there is no decoding of the string possible. Report that.