1a. Define the following terms as used in Logic Programming (4 Marks) i. Fact ii. Structured term iii. Arity iv. Predicate b. Describe each of the following variable quantifiers used in Logic Programming. (2 Marks) i. ? ii. ? c. Interpret the following Logic Expression (4 Marks) i. ?x (greaterThan(Y,X) & greaterThan(15,Y)) ii. ? descendent („Njeru?,?Njeri?) iii. ??X (parent(X,?Atieno?) & parent(X,?Kajwang?)) d. Justify the effect of the variable quantifier „?? by constructing a Truth table for each of the following expression given that X ranges over {4,15} and Y over {7,14} (5 Marks) i. greaterThan(Y,X) & greaterThan(12,Y) ii. ?X (greaterThanY,X) & greaterThan(12,Y)) e. Construct a resolution tree to depict the implementation of Backtracking Resolution Algorithm for the following scenario. (5 Marks)Basic Facts: B1(x) Database:{2,3,4} B21(x) Database:{1,2,3} B22(x) Database:{1,3,9} B3(x) Database:{1,2,5,36}Rules of Inference P1(x) :=B1(x) P2 (x) & B3(x) P2(x) :=B21(x) & B22(x) Verifier Goal: ?P1(1)