Suppose you just wrote the search method for your BinarySearchTree implementation. The specification is below.

search$($e$)$:

Input: An element e

Description: Determine if e is in the tree

Return: True if e is in the tree; False if not.

To test your new method, you build the tree below:

Screen Shot $2023-03-31$ at $9\mathrm{.}53\mathrm{.}03$ AM$.$png

You are not sure if your implementation has flaws. Please select the four integer values that you should search for in this tree to gain as much confidence as possible in the correctness of your algorithm.

Select ONE: