A one dimensional array contains characters from 'a' to 'z'. What is the longest substring which reads the same forward and backward (called a palindrome)?
For example, bobabodob contains the palindrome bob, but the palindrome "obabo" is longer.
Write a program which takes a string of alphabetic characters as input. This string may be up to 100 characters long. This program must find the largest palindrome contained in the string and output it.