PLEASE USE THESE ABSTRACTIONS TO DO THIS PROBLEM IN PYTHON 3

def tree(label, branches-[]): A tree has a root label and a list of branche for branch in branches Verifies the assert is_tree(branchtree definition list (branches) .Each branch is a tree return [label def label(tree): Creates a list return tree from a sequence of branches def branches (tree): Verifies that tree is bound to a list return tree[1:1 def is tree(tree): >>tree (3, [tree(1), if type(tree) ist or len(tree)