Using the binary search tree algorithms discussed in class and alphabetical order: A. Draw the binary search tree that would result from inserting the following sequence of items into an initially empty binary search tree: Matt, Zeke, Pete, Lon, John, Mei, Larry, Bess, Merv, Adam, Kate B. Draw the binary search tree resulting from removing Pete from the binary search tree in A. C. Draw the binary search tree resulting from removing John from the binary search tree in B. D. Draw the binary search tree resulting from removing Lon from the binary search tree in C. E. Draw the binary search tree resulting from removing Matt from the binary search tree in D.