PLEASE USE JAVA

1. Complete the method namedmirror() that alters the tree so that the final tree is a mirror image of the original tree. For example, if we use this method on the tree shown on the left, we end up with the tree shown on the 8 10 0 6 6 14 4 7 13 Original tree Mirror tree 2. Write the insertM), deleteMO and searchMO methods to insert, delete and search for an element in the mirror tree 3. Write the inOrderMO, preOrderM0 and postOrderM methods to traverse the mirror tree. Make sure that the output of each method matches the output of the same method on the original tree Example: OriginalTreeinOrder) has the same output as MirrorTreeinOrderMO which is 1 3 4 67 8 10 13 14 4. Add a method deleteMin) to delete the element with the minimum value