class Node int data; Node left; Node right; public Node(int data) \{ this.data=data; left = mull; right = null; public String toString \{ retum datat" \} Task 2 Define the class BST public class Bst \{ Node root: public Bst0 root = null; Complete the iterative implementation below to insert a key in a BST: public void insert(int x ) \{ Node n= new Node (x); \} Task 4 Complete the recursive implementation below to insert a key in a BST: private void insertR(Node start, int x){ \} public void insertRec(int x){ insertR(root,x); \} Task 5 (Done) Complete the implementation below to search for the minimum in a BS private int minimum(Node root) \{ int min= root.data; while (root.left != null) \{ min= root.left.data; root = rootleft; \} retum min; \} Task 6 (Done) Complete the implementation below to delete an element in a BST: private Node delete_Recursive (Node root, int key)\{ if (root = null) retum root; if ( key root.data) //traver y right subtree rootright = delete_Recursive(rootright, key); else\{ (node contains only one child if (rootleft = null) retum rootright; else if (root right = null) tetumi root.left; root data = minimum(root right); root , ight = delete _- R Recursive(root right, root.data); \} retum noot; y. Woid delete(int hey) . root = delete Recursive(root, key); Task 7 Create the following Tree on slide 26 using the methods implemented in Lab 6. Task 8 Implement the methods inorder, preorder and postorder seen in the lecture. Task 9 Apply the methods implemented in Task 8 to the Tree and verify that you obtain the following results : Preorder Traversal: 3,13,22,19,26,54,71,33,14,11,87,8,56,9,75,28,15,10,63,36,7,6959,68,44 Inorder Traversal: 54,26,71,19,22,11,14,33,8,87,56,13,9,75,3,63,10,15,28,59,69,68,7,36,44 Postorder Traversal. 54,71,26,19,11,14,8,56,87,33,22,75,9,13,63,10,15,59,68,69,7,44, 26293