(2) Suppose you are given the following axioms: A1: VxHorse(x) Mammal(x) A2: VxCow(x) Mammal(x) A3: VxPig(x) Mammal(x) A4: Vxy Offspring(x, y) ^ Horse(y) Horse(x) A5: Horse(Bluebeard) A6: Parent(Bluebeard, Charlie) A7: Vxy Offspring(x, y) Parent(y,x) A8: VxyParent(x, y) Offspring(y,x) A9: VxMammal(x) 3yParent(y,x). Draw the proof tree generated by an exhaustive backward-chaining algorithm for query 3hHorse(h), where clauses are matched in the order given. please draw the tree