Wolfram Mathematica Project

Just consider single words. Do not perform a Caesar cipher transformation on an entire sentence. Let's keep it simple! Also, only consider words that are entirely composed of uppercase letters. We're not going to worry about lowercase letters. Again, I'm trying to keep it relatively simple for you guys. Your job is to flesh out my .nb file and then return it to me. Compose a function--or a collection of functions--that will perform a Caesar cipher transformation on any word (assuming only capital letters) given a number n that represents the amount of shift. Write another function that takes the same encrypted word and they decrypts it, but of course again the function must have access to the number n, which is an integer that tells the function's user how much "shift" is required.