5. (A) Write an inductive definition for the following set: (please include ALL steps) S: lam...
5. (A) Write an inductive definition for the following set: (please include ALL steps) S: lam b^2m | where me N and m >0} *Sis a set of strings, aam bn means amb (B) Write pseudo-code of a recursive function f(x, y) to check whether string x and string y are equal. The alphabet is (a.b). Hint for a given string P, you can verify if it is aQ or bQ (where Q is the remainder of string P) (10 points)