import java.util Scanner;

public class PalindromeExample$2$

$\{$

public static void main$($String args$[])$

$\{$

String original, reverse $=\text{'}\text{'}\text{'}\text{'}$; $//$ Objects of String class

Scanner in $=$ new Scanner$($System$.$in$)$;

System.out.printin$("$Enter a string$/$number to check if it is a palindrome"$)$;

original $=$ in$.$nextLine$0)$;

int length $=$ original.length$0)$;

for $($int i$=$ length $-1$; i$>=0$;i$--)$

reverse $=$ reverse $+$ original.charAt$($i$)$;

if $($original$.$equals$($reverse$))$

System.out.printin$("$Entered string$/$number is a palindrome."$)$;

else

System.out. printIn$("$Entered string$/$number isn't a palindrome."$)$;

$\}$

$\}$

Draw the Control Flow Gragh and find the full complexity