The BTNodeGen instance method search(T s) in the class above is intended to return the depth of the data item s in the tree if it is found, and return -1 if item s is not found in the tree. Given the tree below, show the output that will be produced if the main() fragment were run, assuming the tree, t, is the following:

"A" (depth 1)

/ \

"B" "C" (depth 2)

/ /

"D" "E" (depth 3)

Output:

Searching A at: ________

Searching C at: ________

Searching X at: ________

Searching E t: ________