$2.$ Read a phrase and determine whether it is a palindrome or not. Write a c$++$program to do the following:

a$.$ Read the phrase character$-$by$-$character and store each letters or digits $($use isalnum function$)$ into a linked list pointed by listOriginal

b$.$ Find the middle of the listOriginal

c$.$ Reverse the second half of the listOriginal $($insert each element after the middle element in front of new list listRev and delete the element from the listOriginal.

d$.$ Compare the new listOrginal with listRev to test the phrase for being a palindrome or not

Sample run:

Enter a phrase: Top Spot

Original list: T$$o$$p$$S$$p$$o$$t$$NULL

New original $($half of the original$)$: T$$o$$p$$NULL

The second half in reverse order, listRev: t$$o$$p$$S$$NULL

The phrase is a palindrome $($ character by character they are the same with extra $$S$$ at the end. No matching for $$S$$ because the number of characters is odd$)$

CONTINUE$($y$/$n$)?$ y

Enter a phrase: No$!2332$ on

Original list: N$$o$2332$o$$n$$NULL

New original$($half of the original$)$: N$$o$23$NULL

The second half in reverse order :n$$o$23$NULL

The phrase is a palindrome

CONTINUE$($y$/$n$)?$ n