a) Write the following function print which prints the characters between p and q (inclusive)

void print (char *p, char *q) {

b) Write the following function is_pal which returns whether the string between p and q (inclusive) is palindromic or not (1 for yes, 0 for no)

int is_pal( char *p, char *q ) {

c) Using the above functions write the following function print_palindromes which prints all palindromes in a string as in the example below:

"abcadedabcdefghhgfemncdfgfb" > print adeda efghihgfe fgf

Assume that s conists of only small letters and all the letters are distinct for the first half of any palindrome.

int print_palindromes (char *s) {