programming problems make choice insert into tree delete from tree lookup value choice value has been deleted from the tree make choice insert into tree delete from tree lookup value choice value was not in the tree the hardest part of this program is deleting from the tree you can write recursive function to delete value in some waysthe delete from tree function is like the insert function given in the you will want to write two functionsone that is method to call on binary search tree to delete valuethe other would be hidden recursive delete from tree function the recursive function should be given tree and value to delete it should return the tree after deleting the value from the tree the recursive delete function must be handled in three cases as follows case the value to delete is in node that has no children in this casethe recursive function can return an empty tree ( nonebecause that is the tree after deleting the value from it this would be the case if the were deleted from the binary search tree in fig in fig the right subtree of the node containing is now none and therefore the node containing is gone from the tree case the value to delete is in node that has one child in this casethe recursive function can return the child as the tree after deleting the value this would be the case if deleting from the tree in fig in this caseto delete fig the tree after deleting this copy belongs to 'acha