Write a visualization program (can be text-based) for the brute-force string-matching algorithm.

A palindrome is a string that reads the same forward and backward. For example,“deed” and “level” are palindromes. Write an algorithm in pseudocode that testswhether a string is a palindrome. Implement your algorithm as a static method inJava. The method should call itself recursively and determine if the string is apalindrome.Write a main method that reads a string from the user as input and pass it to thestatic method. You need to validate the string and make sure it contains only letters(no digits or special characters are allowed). The main method should displaywhether the string is a palindrome or not. a)  Read the string from the user and validate it.b)  Create a method that calls itself recursively and returns whether thestring is a palindrome or not.c)  Include a test table with at least the following test cases:1. Invalid input. For example, string contains a number or specialcharacter.2. A valid string that is a palindrome.3. A valid string that is not a palindrome.

I need help with my java compiler program by  Generating intermediate code from the AST, such as three-address code or bytecode   import java.util.*; public class SimpleCalculator { private final String input;private int position;private boolean hasDivByZero = false;private Map<String, String> symbolTable; public SimpleCalculator(String input) {    this.input = input;    this.position = 0;    this.symbolTable = new HashMap<>();} public static void main(String[] args) {    SimpleCalculator calculator = new SimpleCalculator("3 + 5 * (2 - 1)");    int result = calculator.parseExpression();    if (calculator.hasDivByZero) {        System.out.println("Error: division by zero");    } else {        System.out.println("Result: " + result);    }} public int parseExpression() {    int value = parseTerm();    while (true) {        if (consume('+')) {            value += parseTerm();        } else if (consume('-')) {            value -= parseTerm();        } else {…