Please provide the solution in C language for the following question. Be sure to fulfill all the requirements of the question and the output. The code should generate a binary tree using random numbers after asking the user to input the number of nodes in the tree. Then it should remove a specific node in the tree (ask user's input) and display the updated binary tree. Then it should be able to search an item in the tree as asked by the user and if the item is present in the tree, the code should print out the visiting trace path of that search and if the item is not present in the tree, it should print: the item is not found. The code should allow the user to repeat the process without the need to rerun the program. Thanks.

Write a menu-driven program that offers the following menu items: 1. Create an integer binary tree 2. Display the tree in in the console. 3. Remove a specific node in the tree 4. Display the tree in in the console. 5. Search an item in the tree and show the visiting trace path For the binary tree creation, you can address this by an automatic process via random number generation. You may ask user input for the number of nodes in the tree. For the search feature, the program will print out the visiting trace path of that search at the end of the operation. If the item is not found, a message saying "the item is not found" is printed to the console instead. Example of displaying a binary search tree (use the right representation for your submission) 5 5 11 2 10 2 10 // 1 4 7 12 1 4 7 12 Original Tree Display in your Console Your output file should include the following: 1. The tree that you created 2. The tree after removing a node 3. Both cases for Search function (foundot found) Write a menu-driven program that offers the following menu items: 1. Create an integer binary tree 2. Display the tree in in the console. 3. Remove a specific node in the tree 4. Display the tree in in the console. 5. Search an item in the tree and show the visiting trace path For the binary tree creation, you can address this by an automatic process via random number generation. You may ask user input for the number of nodes in the tree. For the search feature, the program will print out the visiting trace path of that search at the end of the operation. If the item is not found, a message saying "the item is not found" is printed to the console instead. Example of displaying a binary search tree (use the right representation for your submission) 5 5 11 2 10 2 10 // 1 4 7 12 1 4 7 12 Original Tree Display in your Console Your output file should include the following: 1. The tree that you created 2. The tree after removing a node 3. Both cases for Search function (foundot found)