Question 10 0.8 pts A certain language of predicate logic contains one constant symbol a, a unary function symbol f,a binary function symbol 9, and a variable symbol X. The expression f(g) Select The expression g(a, f(x) Select ) The expression f(f(X), g(a, X)) [Select ] The expression glola,a),f(a),aSelect I Select ] I Select ] is a term but not a ground term is a ground term is not a term In addition, the language also contains a unary relation symbol P and a binary relation symbol q. The expression Vz q(x, g(x,) [Select The expression pg(a,f(a)))A3zp(f(x))ANzdf(a), f(f(a))) [Select ] The expression p(g(a, f(a)) A3 f(z) AVa q(f(a), f(f(a)) [Selectl The expression-9(p(a)f,) Select ] a well formed formula (wf) awff Is/Is not