$(2$ pts each$)$ Given the following set of Prolog facts$/$rules:

fact $(a,b).$

fact $(b,c).$

fact $(c,d).$

fact $(c,e).$

fact $(d,e).$

funFact $(x,Y)$ :$-$ fact$(x,Y).$

funFact $(x,Y)$:$-$fact$(x,T),$ funFact $(T,Y).$

Indicate whether the following function "queries" resolve to true or false and indicate the value of Result where applicable.

$25.$ fact $(m,n).$

$26.$ fact $(a,b).$

$27.$ fact $,$ Result$).$

$28.$ funFact$($a$,$ Result$).$

$29.(3$ pts$)$ Show an Abstract Syntax Tree for the following Scheme S$-$Expression:

$($define $r($if $(<mtext\; id="EditorElement\_1583144"></mtext><mn\; id="EditorElement\_1583145">1</mn><mtext\; id="EditorElement\_1583146"></mtext><mn\; id="EditorElement\_1583147">2</mn><mi\; id="EditorElement\_1583148">)</mi><mtext\; id="EditorElement\_1583149"></mtext><mi\; id="EditorElement\_1583150">(</mi>$if $(>53)"$a$""$b$")"$c$"))$