Givestion $3$: $(25$ points$)$ Binary Search Tree $($BST$)$

Given the below binary search tree, answer A$-$C

A$.(9$ points$)$ Traverse the tree usiny moraer, preorder, and postorder

Hint: $($ inorder: left root right, preorder: root left right, postorder: left right root

B$.(8$ points$)$ Write the pseudo code to delete $6$ then draw the tree.

C$.(8$ points$)$ Write the pseudo code to delete $9$ then draw the tree.