write it by C programming and also show the result console sreenshot

Problem 3 Write a function binaryTreeSearch that takes as arguments a pointer to the root node of the binary tree and a search key to find each in the binary search tree same as problem 2 to that node; otherwise, the function should return a NULL At first, generate 10 random numbers(range: 1-20) and inserts If the search key is found, the function should return a pointer pointer There is a sample code in next slide and blackboard The numbers being placed in the tree are: The numbers being placed in the tree are: 10 5 8 13 8dup 13dup 10dup 1 9 18 Enter an integer to search for: 10 10 was found in the tree 4 16 18 3 1? 18 11 6 6dup 20 Enter an integer to search for:2 2 was not found in the tree