They are related so I put them together, any help is appreciated.

Write down the following sentences in the 1st-order logical representations, suitable for their use with Generalized Modus Ponens, i.e. in Horn clauses. Do NOT convert them in CNF. Horses, cows, and pigs are mammals. An offspring of a horse is a horse. Bluebeard is a horse. Bluebeard is Charlie's parent. Offspring and parent are inverse relations. Every mammal has a parent. From the sentences you wrote in Q6, answer the following question using a backward-chaining algorithm. Draw the proof tree generated by a backward chaining algorithm for the query 3 h, Horse(h), where clauses are matched in the order given. What do you notice about this domain? How many solutions for h actually follow from your sentences