Answer in Java

QUESTION 1 [5 points] Write a method findMax that returns the maximum value in a binary search tree where you have has two methods: x. left () that returns a reference to the left child, and x.right ( ) to the right child.)