Using java, create three Binary Search Trees of students. The names come from text files that need to be read line by line and separated by First Name, Last Name, and ID number. The text file and each line will be included below.

$-$Add the students from the text file studentName$1.$txt to the first Binary Search Tree:

$-$Add the students from the text file studentName$2.$txt to the second Binary Search Tree:

$-$If a student in the first Binary Search Tree is also in the second Binary Search Tree, then add this student to the third Binary Search Tree.

$-$Print out how many students are in the third Binary Search Tree.

$-$Print out these common students from the third Binary Search Tree.

studentName$1.$txt

$-$John

$-$Smith

$-01$

$-$Lisa

$-$Jones

$-02$

$-$Paul

$-$Holmes

$-03$

$-$Rex

$-$Hall

$-04$

studentName$2.$txt

$-$Mike

$-$Jimms

$-05$

$-$Lisa

$-$Jones

$-02$

$-$Pablo

$-$Hill

$-06$

$-$Rex

$-$Hall

$-04$