In this lab, you would be writing a BinarySearchTree and BinaryTreeNode. As a refresher: the nodes contained in the left subtree must be LESS THAN the parent and nodes contained in the right subtree must be GREATER the parent $($for simplicity, you can assume all the integers are unique$).$ Here is some code to help you get started: class Node: def $\_\_$init$\_\_($self$,$ init$\_$data$)$: self.data $=$ init$\_$data self.left $=$ None self.right $=$ None self.parent $=$ None class BST: def $\_\_$init$\_\_($self$)$: self.root $=$ None You have to implement the following functions in BinarySearchTree class: insert: Should take in a value to be inserted and return nothing. It needs to insert this such that the tree remains a BST $($see the italicized text above$).$ Delete: The deletion process in a Binary Search Tree $($BST$)$ involves handling three main cases: $1.$ Deleting a node with no children $($a leaf node$)$: Remove the node directly without affecting the rest of the tree structure. $2.$ Deleting a node with one child: Replace the node with its child, ensuring the tree's ordering property is maintained. $3.$ Deleting a node with two children: Find the node's in$-$order successor $($or predecessor$),$ typically the minimum $($or maximum$)$ node in its right $($or left$)$ subtree, replace the node to be deleted with this successor node, and then delete the successor node from its original position in the subtree. Adjust the tree to preserve the BST structure after deletion.