C Programing Language

Bibi really likes palindromic strings. A string is called a palindrome if it reads the same backward as forward, for example the words level and reviver are palindromes but the word orphans and daddy are not. Now, given a string S which only consists of lowercase letters from a to z, can you tell if the word is a palindrome or not?

Note: please use function and recursion to solve this problem.

Format Input The first line of the input contains T, which is the number of testcases. Each testcase consists of a single line consisting of string S.

Format Output For each testcase, output one line containing Case # X: (without quotes) where X is the testcase number (starting from 1) and then followed by the yes if the string is a palindrome, or no if the string is not a palindrome (please output yes or no without quotes) Constraints 1 T 100 1 |S| 1000 (|S| means the length of string S) S only consists of lowercase letters from 'a' to 'z' Sample Input (standard input) 4 level daddy orphans reviver Sample Output (standard output) Case #1: yes Case #2: no Case #3: no Case #4: yes

!! ATTENTION !! 1. Please READ the assignment carefully!! 2. Input and Outpust MUST be EXACTLY the SAME as SAMPLE! - PLEASE READ CAREFULLY THE SAMPLE of INPUT and OUTPUT !! - Do not use void 3. Please use c language and with explanation! 4. Please DO NOT answer if you are not sure of your answer!

please follow the instruction above, and thank you for following the instruction above :)