$($ Completely solve the question in the image in Java $)$

Write a program that reads a list of numbers from the user and lets the user

insert, delete, and search for values in the tree. The program should be menu

driven allowing for inserting, searching, and deleting from a binary search tree.

Inserting into the tree should allow for multiple inserts as follows.

Binary Search Tree Program

Make a choice...

Insert into tree.

Delete from tree.

Lookup Value.

Choice? $1$

insert? $5$

insert? $2$

insert? $8$

insert? $6$

insert? $7$

insert? $9$

insert? $4$

insert? $1$

insert?

Make a choice...

Insert into tree.

Make a choice...

Delete from tree.

Insert into tree.

Lookup Value.

Choice? $3$

Value? $8$

Delete from tree.

Lookup Value.

Choice? $2$

Value? $5$

Yes, $8$ is in the tree $5$ has been deleted from the tree.

Make a choice...

Insert into tree.

Delete from tree.

Lookup Value.

Choice? $2$

Value? $3$

$3$ was not in the tree.