Write pseudo-code, not Java, for problems requiring code 1. Write an algorithm to determine whether an input character string is of the form a DbDcD...D: Where each string a, b, ...z is of the form of the string defined in problem 3. (Thus a string is in the proper form if it consists of any number of such strings from problem 3, separated by the character 'D', 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. Write pseudo-code, not Java, for problems requiring code 1. Write an algorithm to determine whether an input character string is of the form a DbDcD...D: Where each string a, b, ...z is of the form of the string defined in problem 3. (Thus a string is in the proper form if it consists of any number of such strings from problem 3, separated by the character 'D', 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