3. Which of the following strings are formulas in predicate logic? Specify a reason for failure for strings which aren't, draw parse trees of all strings which are. (a) Let m be a constant, fa function symbol with one argument and S and B two predicate symbols, each with two arguments: (B(x, y) (Iz S(z, y))) b. (S(x, y) S(y, f(f(x)))) (B(x) B(B(x))). a. c. 3. Which of the following strings are formulas in predicate logic? Specify a reason for failure for strings which aren't, draw parse trees of all strings which are. (a) Let m be a constant, fa function symbol with one argument and S and B two predicate symbols, each with two arguments: (B(x, y) (Iz S(z, y))) b. (S(x, y) S(y, f(f(x)))) (B(x) B(B(x))). a. c