Programming Language: Python

For this question, you must define a function called create a tree0 which builds and then returns the following binary tree: That is, you must build a tree with a root node that contains the value 'a', and which has a left child of 'b' and a right child of 'c The BinaryTree class is written for you and is listed below - you do not need to provide this class. You should build your tree by calling the BinaryTree0, insert left0 and insert_right0 functions in the BinaryTree class. class Binary Tree def init (self, data): self.data = data self.left = None self.right = None def insert left(self, new data): self.let. BinaryTree(new t BinaryTree(new data) if self. left == None: data) else t. left-self.|eft self.leftst def insert right self, new _data) if self.rights. None: self.right BinaryTree(new data) else t BinaryTree(new data) t.right = self.right self.right t def get left(self) def get right (self) def set data(self, data) def get data(self) return self.left return self.right self.data = data return self.data Define the create a_tree0 function below: def create_atreeO For example: Test Result a = create-a-tree print(a.get data print(a.get leftO.get data print(a.get_rightO.get_data))