Tasks: Implement a Binary Search Tree with the following functionalities:

$1.$ Insert the values: $50,30,70,20,40,60,80$ sequentially.

$2.$ Delete the value $70$ from the BST$.$

$3.$ Search for the value $20$ in the BST$.$

$4.$ After each operation, provide the tree structure and show the

in$-$order traversal result.

Deliverables:

$1.$ Python file $($bst$.$py$)$ with the implementation of the BST and its functions.

$2.$ A brief report $($Word or PDF$)$ showing the tree structure and in$-$order

traversal after each operation.