Consider the below elements:

D$,$ A$,$ T$,$ S$,$ R$,$ U$,$ C$,$ E

i$)$ Show the insertion of these elements into an initially empty Binary Search Tree $($BST$)$

in the same order. Show the final BST after all the insertions are completed. Hint: ASCII

of $\text{'}$ A $\text{'}$ is $65.$

ii$)$ Perform the deletion of $\text{'}$ R $\text{'}$ from the BST built in