PLEASE USE JAVA TO WRITE THIS CODE, THANKS.

Binary Search Tree Taskl 1. Complete themethodnamediza) that alters thetree so thatthe final Task2 Implementa class named Performers that displays of the top ten performers in a video tree is a mirrorimage ofthe originaltree. For example, if we use this method onthe tree shown onthe left, we endup with the tree shownon the game m ascendmg order. Each performer has a name andscore. Here is an example of such performers. JediMaster 95, G-Man 99, Whiz 105, Spike 120. Use aclass based on MyBST. The class should have: -a constructor that sets up an empty tree, -a void insert(String name, score) method that adds a name and a score pair to the tree. The tree should have a maximum size of 10. After the tree has 10 elements, an attempt to add aname with a score that is less than or equal to the mmimum score on the tree is ignored, and adding a score that is greater than the mimimum score causes an entry with the minimum score to be dropped from the tree. 10 7) (13 Primtthe list ofperformers sorted by score. Oiginaltree Mirrortree 2. Write the insertMO, deleteMO and searchMO methods to insert, delete and search for anelement in the mirror tree 3. Wrnte the inOrderMO prderM0 andpostQrderMO methods to traverse the mirrortree.Make sure thatthe outputofeachmethod matches the outputofthesame methodon the ornginaltree Example: OriginalTree inOrder0 has the same output as MirorTreeinOrderMOwhichis 13 4678101314 4. Adda method deleteMin0to delete the element with the mirimumvalue 5. In an applicationclass checkif all newmethods are workingproperly Binary Search Tree Taskl 1. Complete themethodnamediza) that alters thetree so thatthe final Task2 Implementa class named Performers that displays of the top ten performers in a video tree is a mirrorimage ofthe originaltree. For example, if we use this method onthe tree shown onthe left, we endup with the tree shownon the game m ascendmg order. Each performer has a name andscore. Here is an example of such performers. JediMaster 95, G-Man 99, Whiz 105, Spike 120. Use aclass based on MyBST. The class should have: -a constructor that sets up an empty tree, -a void insert(String name, score) method that adds a name and a score pair to the tree. The tree should have a maximum size of 10. After the tree has 10 elements, an attempt to add aname with a score that is less than or equal to the mmimum score on the tree is ignored, and adding a score that is greater than the mimimum score causes an entry with the minimum score to be dropped from the tree. 10 7) (13 Primtthe list ofperformers sorted by score. Oiginaltree Mirrortree 2. Write the insertMO, deleteMO and searchMO methods to insert, delete and search for anelement in the mirror tree 3. Wrnte the inOrderMO prderM0 andpostQrderMO methods to traverse the mirrortree.Make sure thatthe outputofeachmethod matches the outputofthesame methodon the ornginaltree Example: OriginalTree inOrder0 has the same output as MirorTreeinOrderMOwhichis 13 4678101314 4. Adda method deleteMin0to delete the element with the mirimumvalue 5. In an applicationclass checkif all newmethods are workingproperly