I need help with this C language program. Please help me ASAP.

Assignment

The objective of this lab is to write a 20-questions style guessing game that gets smarter as you play. To achieve this, you will create a decision tree data structure using malloc() and free().

Game Play

When you run your program, it will be the guesser in a 20-questions game. First, you think of an animal, and the program will take a guess at what animal you are thinking of. When you first start the program, the only animal it knows is "dog", so it will ask you "Is it a dog?". If you were in fact thinking of a dog, the program says "I win!" and exits.

On the off chance that your animal was not a dog, the program will then ask what animal you were thinking of. Let's say it was a duck. The program will then ask "Please give me a yeso question that would distinguish between a dog and a duck." Let's assume you give the answer "Does it have fur?". It will then ask "Would the answer to this question be yes or no for a dog?" The program will use this answer to build a small decision tree. Next time you run the program, it will ask "Does it have fur?" If you say yes, it will guess dog, if you say no it will guess duck. Each time you play, the program adds to the decision tree and gets better at the game.

Grading:

Task	Points
Game play: Your program should correctly compile. When run, it should play the 20-questions game an arbitrary number of times, learning a new question at each iteration.	25
Program style and documentation: Your program should exhibit excellent programming style, including proper use of #define, inline comments, block comments, and ample use of whitespace for readability. Searching and inserting into your decision tree should be implemented as subroutines.	15
Clean up and exit: When your program exits, it should deallocate the final decision tree, printing out each node as it is deleted. Note: this is most easily done recursively using a pre-order traversal. This will be explained in detail in the lab session.	10

Example of this game is in the attached Image:

Transcribed Image Text:

Is it a dog? > no I lose! What animal were you thinking of? > duck Please give me a yes/no question that distinguishes between a dog and a duck. > Does it have fur? Would the answer to this question be yes or no for a dog? > yes Thank you. Would you like to play again? > yes Does it have fur? > no Is it a duck? x0 > no I lose! What animal were you thinking of? > fish Please give me a yes/no question that distinguishes between a duck and a fish. > Does it have feathers? Would the answer to this question be yes or no for a duck? > yes Thank you. Would you like to play again? > no The decision tree at the end of this game would look like this: 4 Question: Is it a dog? Yes Question: Does it have fur? Yes No xo Question: Is it a duck? Yes No Question: Does it have feathers? Yes No 20 Cleaning up: Deleting question: "Is it a dog?" Deleting question: "Is it a duck?" Deleting question: "Is it a fish?" Deleting question: "Does it have feathers?" Deleting question: "Does it have fur?" Done. No Question: Is it a fish? Yes No The pointers to x0 in this figure are null pointers (pointers to the address zero). The longer you play, the bigger the decision tree grows, and the better your program becomes at the 20-questions game. Example clean-up output for the tree above: Is it a dog? > no I lose! What animal were you thinking of? > duck Please give me a yes/no question that distinguishes between a dog and a duck. > Does it have fur? Would the answer to this question be yes or no for a dog? > yes Thank you. Would you like to play again? > yes Does it have fur? > no Is it a duck? x0 > no I lose! What animal were you thinking of? > fish Please give me a yes/no question that distinguishes between a duck and a fish. > Does it have feathers? Would the answer to this question be yes or no for a duck? > yes Thank you. Would you like to play again? > no The decision tree at the end of this game would look like this: 4 Question: Is it a dog? Yes Question: Does it have fur? Yes No xo Question: Is it a duck? Yes No Question: Does it have feathers? Yes No 20 Cleaning up: Deleting question: "Is it a dog?" Deleting question: "Is it a duck?" Deleting question: "Is it a fish?" Deleting question: "Does it have feathers?" Deleting question: "Does it have fur?" Done. No Question: Is it a fish? Yes No The pointers to x0 in this figure are null pointers (pointers to the address zero). The longer you play, the bigger the decision tree grows, and the better your program becomes at the 20-questions game. Example clean-up output for the tree above:

Answer rating: 100% (QA)

The image youve provided appears to be an example of how the decision tree for the guessing game operates and how it should clean up on exit To create ... View the full answer