This is a prolog code for animal identification I want you ti draw search tree

$2\mathrm{.}1/$ AnImaI Identirication game

Here is a Prolog version of the animal identification game $($simple expert system$)$ presented in a Lisp program in Chapter $6$ of Winston and Horn $(1985).$ Load the file and pose the query $?-$ go$.$ The program uses its identification rules to determine the animal that you have chosen.The program is mainly interesting with regard to how it tries to verify certain properties tha it uses to draw conclusions, and how it asks questions and records the answers for further reference. If a question q is asked and the answer is 'yes', then that answer is recorded by asserting 'yes$($q$)\text{'}$ and succeeding, otherwise the answer is recorded by asserting $\text{'}$no$($q$)\text{'}$ and failing. Even 'yes' answers need to be recorded since a subsequent $\text{'}$no$\text{'}$ answer to a different question while trying to verify the same hypothesis may cause the entire hypothesis to fail, but that same 'yes' answer could lead to a successful verification of a different hypothesis later. This is how the nrogram avoids asking the same auestion twice. The general method