$2(10$ points$)$ Binary Search Trees

$($a$)$ Show a result of inserting $6,4,2,8,1,9,7,5,3$ into an initially empty binary search tree.

$($b$)$ Show the result of deleting the root.