Make a function with the following struct tnode:

struct tnode t int data: struct tnode left; struct tnode right and then make a function named struct tnode small (int root,int left,int right) that builds a 3-node tree as follows: - the root should contain the value passed in the first argument (root) -the left node should contain the value passed in the second argument - the right node should contain the value passed in the third argument the root should point the the left and right nodes (in the obvious way) -all other nodes' pointers should be NULL Return the address of the root as the function' s value