For the program p(a) p(b) p(c) q(b, a) q(b, c) q(c, d) q(d, c) q(e, f) r(X, Y): -p(X), q(X, Z), q(Z,Y) s(X, Y): -r(X, Y) s(X, Y): -s(X, Z), q(Z,Y). develop a Prolog derivation tree (including annotated unifiers) until the first two (clearly marked) solutions are found, starting from the following query: ?-s(X,Y) please, the handwriting sign tree on paper!