Q2. Figure 2 below represents a binary search tree. Draw a new binary search tree after the node A is deleted using the binary search tree deletion that is covered in the class *Note: The character represents a name of node, not a key value of the node. B H M Figure 2. Binary search tree