Write a recursive search function in Python for finding an element in a binary search tree. You should use the notion of a left or right subtree of a node in your definition (In Definition 3.8, the left and right subtrees are T₁and T₂, respectively.) Make sure you account for empty nodes.

Definition 3.8 Let S be a set that is totally ordered by S. A binary search tree on S is Bi . The empty tree, or B2. a single vertex r e S. In this case, r is the root of the tree. R. If Ti and T2 are binary search trees with roots ri and r2, respectively, and if a S r for all nodes a E T, and r s b for all nodes b e T2, then the tree T2 is a binary search tree with root r