PLEASE WRITE PSEUDO CODE THAT USES STACKS TO SOLVE THIS PROBLEM. Write an algorithm to determine whether an input character string is of the form a D b D c D D z Where each string a, b, z are of the form x C y where x is a string consisting only of the letters A and B and y is the reverse of the x (i.e. if x=ABABBA then y must equal ABBABA). The complete form will look like this e.g. "ABBCBBADACADBABCBABDAABACABAA". At each point you may read only the next character in the string, i.e. you must process the string on a left to right basis. You may not use string functions.