Create a binary search tree $($BST$)$ to hold integer data and perform the following operations on it:

$($a$)$ Insertion of an integer into BST $($no duplicates$)$

$($b$)$ Deletion of a given integer

$($c$)$ Find a given integer in BST

$($d$)$ Find minimum element in BST

$($d$)$ Display the integers in ascending order

Trace the tree using the diagrammatic representation of the tree.