Using Python, FILL IN THE BODY OF CODE THAT IS REQUIRED (seen in the height() method):

class Tree: A recursive tree data structure. # Private Attributes # The item stored at this tree's root, or None if the tree is empty. _root: Optional [Any] # The list of all subtrees of this tree . subtrees: Listl Tree def init__(self, root: Any, subtrees: List [Tree]) ->None: """Initialize a new Tree with the given root value and subtrees If is None, the tree is empty Precondition: if is None, then is empty. self._rootroot self. subtrees - subtrees def is_empty(self) -bool: "Return True if this tree is empty >>> t1 = Tree (None, []) >>>t1.is_empty) True >>>t2.is_empty() False return self. root is None def height(self: Tree) -> int: ""Return the height of this tree Please refer to the prep readings for the definition of tree height. >>t1 Tree(17, [) >>t1.height() >t2Tree(1, [Tree(-2, [1), Tree(10, []), Tree(-30, [1)1) >>>t2.height() 2 if self.is_empty): return0 elif self'-subtrees = []: return 1 else: FILL IN THIS PART