Using an recursive approach, write a function: find_node(bst_node* node, int value) that returns the node with the given target value in a BST. — bst_node* find_node(bst_node* node, int value) { if (node == NULL) return false; if (value < node->value) { return find_node(node->left, value); } else if (value > node->value) { return find_node(node->right, value); } else { return node; } }