class BinarySearchTree

$\{$

$//$ attributes

int size;

Node root;

$//$methods

Boolean search$($int id$)$

void insert$($int id$,$ String name$)$

void delete$($int id$)$

void split $($int id$)$

$\}2$ Copy the above definitions into the corresponding files Write code for a default and a loaded constructor for BinarySearchTree Write accessor and mutator methods for the attributes of BinarySearchTree Extend the BinarySearchTree class:

$2\mathrm{.}1$ Write code for the method search$($int key, Node root$)$

$2\mathrm{.}2$ Write code for the method insert$($int key, Node root$)$

$2\mathrm{.}3$ Write code for the method delete$($int key, Node root$)$

$2\mathrm{.}4$ Write code for a main method to build a BST Follow each and evry step and write code in java.This is for marks so give correct code