Using java, create three Binary Search Trees of students.

$-$Add the students from the following list to the first Binary Search Tree: $($Bob$,$ Sara, John, Steve, Paul$)$

$-$Add the students from the following list to the second Binary Search Tree: $($Mike$,$ Bill, Sara, Steve, Phil$)$

$-$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.