A word that reads the same backward as forward is called a$$palindrome$,$ e$.$g$.,$ "mom", "dad", "racecar", "madam", and "Radar" $($case$-$insensitive$).$ Write a program called$$TestPalindromicWord$,$ that prompts user for a word and prints $""$xxx$"$ is$|$is not a palindrome".

$$

Note:

$1.$ Maintain two indexes,$$forwardIndex$($fIdx$)$ and$$backwardIndex$($bIdx$),$ to scan the phrase forward and backward.

$2.$ int fIdx $=0,$ bIdx $=$ strLen $-1$;

$3.$ while $($fIdx $<$ bIdx$)\{$

$4.......$

$5.++$fIdx;

$6.--$bIdx;

$7.\}$

$8.//$ or

$9.$ for $($int fIdx $=0,$ bIdx $=$ strLen $-1$; fIdx $<$ bIdx; $++$fIdx, $--$bIdx$)\{$

$10.......$

$\}$