$3$a$).$ Develop a program to find the reverse of a given number and check the given number is palindrome

or not.

b$)$ i$)$ If n is not a palindrome, determine the minimum number of digit exchanges required to transform

n into a palindrome.

ii$)$Then also the number is not palindrome, develop a program how many digits changed to transform n

into a palindrome.

c$).$ Develop a C program to find the maximum digit in a given number n$.$ Additionally, determine how

many times this maximum digit appears in the number and find the position of the digit.

d$)$Develop a C program to reverse the digits of a given number n$.$ Then, check if the reversed number

is a

i$)$prime number or not

ii$)$ perfect square or not.