URGENTTT C PROGRAMMING ANS FASTTT PLEASE

> Tutorial_8.pdf x C Get Homework Help With Che X | + c G : !!! Apps YouTube M Gmail Maps Yandex.Mail Tutorial_8.pdf 1 / 7 Section A: Caesar Cipher In this section you will implement one of the oldest known coding techniques, called the Caesar Cipher, which encrypts a message by rotating the letters of the alphabet in a cyclical fashion. You can read about the Caesar Cipher on this Wikipedia page Write a function int rotate_right(int ch) which rotates a specified alphabetic character one step to the right, and returns the new character. In other words, it should convert 'A' to 's', B toc Y to 2', and 'Z' to 'A'. Lowercase letters should be rotated in the same fashion Write a function int rotate_left{ int ch) which performs the inverse of rotate_right converting 'a'to Z, 'b' to 'a', etc. and returns the new value Write a functionint encodeint ch, int shift) which performs the Caesar encryption for a single character by rotating the specified number of times (shift). The function should repeatedly call rotate_right() or rotate_left u depending on whether shift is positive or negative shift is zero, the original character should be returned unchanged.) Finally, write the full program caesar.c which performs the Caesar encryption for an entire text. Your program should prompt the user, enter the shift, then enter the original text, and finally output the encoded text The output should looks like below: Enter shift: 1 : Enter text HAL IBM Enter shift: -5 Type here to search G AO 40 ENG 12:48 AM 1/11/2021 F Tutorial_8.pdf X C Get Homework Help With Cheg c G Search Google or type a URL Apps YouTube M Gmail Maps Yandex.Mail Enter Text Cry Havoc, and let to the Dogs of War XmCwxr, vypappkocz vibnjam The stancocks for your main function louk something like this int main void whileli ch geteel BOT patchar ... ) zaten : Can you decrypt the following text? Adly phap pu sol pentru Dopo la mswk, she was my Vtpaal, has a chilly Pe buku hawde huku Type here to search H AOA 40 ENG 12:48 AM 1/11/2021