With good drawing please

Q4. Consider the following program that checks if strine/ number is a pulfindrome a) Draw the CFG of the program and cilculate the tull import java.util.Scanner: public class PalindromeExamplez 1 public static void main(String args(li) \{ String original, reverse =";// Objects of String, class Scanner in = new Scanner(System.in): System.out.println("Enter a string/ number to check if it is a palindrome"): original = in.nextLine(): int length = original. length(): for ( int i= length 1;i>=0;i1 reverse = reverse + original.charAt(i): if (original.equals(reverse)) System.out.printin("Entered stringumber is a palindrome."); else System.out.printin("Entered stringumber isn't a palindrome."): \} \}