2. Write a recursive function that generates the nth Fibonacci number. 3. Write the code to insert a new node into a binary tree in its proper sorted position. Use the binary tree node definition below: typedef struct bintree_node { int value; struct bintree_node *left; struct bintree_node *right; } SBINTREE_NODE; SBINTREE_NODE *root;