Take the following steps for a recursive removal of a binary search tree and convert it a possible implemention in python 3 code.

def __remove_recusive(self, node, value)

if t is None: ? The value is missing. Raise an exception. if t.value == x: ? if t has zero children: ? ? return None ? elif t has one child: ? ? return that child node ? elif t has two children: ? ? find the smallest value m from t.right ? ? set t.value = m ? ? remove m from the subtree rooted at t.right if x < t's value: ? update t's left child to be the return value of remove x from t.left if x > t's value: ? update t's right child to be the return value of removing x from t.right. return t