Two questions regarding binary search tree:

(a) What does the following function return when called with a binary search tree as parameter? def mystery element(binary search tree): if binary search tree is None: return None return binary search tree return mystery element(binary search tree.right) elif binary search tree.right is None: else Assume the node with key 41 is to be deleted from the search tree. Which action is most preferably to be taken to keep the search tree intact? (b) 60 90 4 41 71 10 29 84 23 37