Given the following prolog code, list all solutions in order for the query c(X,Y,Z) a(1) a(2) b(a) c(A,B,C) :- a(A), d(B,C) c(A,B,C) :- b(A), d(B,C) d(B,C) :- a(B), !, a(C) d(B,_) :- b(B)

What does prolog return for the following query :power(0,_,1):-1.power(1,N,N):- I.power(P, Num, Res):- P1 is P - 1, power(P1, Num, TempRes), Res is TempRes * Num2- power(3, Num, 8)Free

1. Consider the following Prolog facts and rules: member (X, (X|_]). member (X, [_T]) :- member (X, T). subset ((), _). subset([HT], S) :- member (H, S), subset (T, S). (a) (b) Draw the Prolog tree corresponding to the following query: ?- subset([a,b], [a,b,a]). true ; true ; false. There are 7 possible places to insert a single cut (!) in the set of axioms, marked below by [1]-[7]: member (X, (✗|_]) :- ![1]. member (X, [_[T]) :- ![2], member (X, T), ! [3]. subset ((), ) :- ! [4]. subset([HT], S) :- ![5], member(H, S), ! [6], subset (T, S), ! [7] . Which of these cuts are causing a unique solution as shown below? (You are using a single cut at a time.) ? subset1 ([a,b], [a,b,a]). true. Explain the role of each cut by showing what parts of the tree it removes.

The class I'm taking is computer science discrete structures. I am completely stuck. Please help! If you can please add an explanation with answer so I can better understand . Thank you!