Question about Datalog I need answer for all sections a,b and c... c is the most difficult for me i really need its answer.

110%) Consider the following logic program P, which uses the function symbol h. ri: p(X,X) - q(X) r2: p(h(Y),Y) p(Z, Note that we have not provided the tuples in the EDB relation q. Now consider the query pCx,X) (a) Suppose q is a finite relation. What would be the size of the IDB relation p in b) Now suppose q is infinite. What can we conclude about the size (number of (c) If relation q has one tuple: (f (g(a,b))), draw the derivation tree for the query that would it be finite or infinite? tuples) of relation p? pCX,Y). State your observations. 110%) Consider the following logic program P, which uses the function symbol h. ri: p(X,X) - q(X) r2: p(h(Y),Y) p(Z, Note that we have not provided the tuples in the EDB relation q. Now consider the query pCx,X) (a) Suppose q is a finite relation. What would be the size of the IDB relation p in b) Now suppose q is infinite. What can we conclude about the size (number of (c) If relation q has one tuple: (f (g(a,b))), draw the derivation tree for the query that would it be finite or infinite? tuples) of relation p? pCX,Y). State your observations