QAnswer ASAP please. $1$: Label each node in the following binary tree with keys from the set $\{T,O,W,S,N,C,$I,$A\}$ so that it is a valid Binary Search Tree with respect to alphabetical ordering of keys. $[3$ pts $]$

Q$2$: Based on the BST generated in Q$1,$ now we delete the key I from the BST$.$ Plot the corresponding BST after the deletion operation. $[2$ pts$]$