3. A tree can be represented in tuples in Python as follows: (a) if the tree contains a single leaf node L, it can be represented by an non-tuple object L (b) if the tree has more than one node and is rooted at N, then it can be represented by a tuple (S1, S2, ... Sk) where Si represents the i th subtree of N. Consider for example the following five trees. ht Their representations in tuples are respectively ((("1","e"),"f"),"t"),(5,"fo",3.1,0.2),(1,("foo",3.1),0.2),(((1,2),("fo",3.1)),("bar",0.2))("r",("i",("g",("h","t")))). Write a single Python function, called ANON. It takes a single argument TREE that represents a tree, and returns an anonymized tree with the same structure, but where all symbols and numbers in the tree are replaced by a question mark. The anonymized versions of the trees above are as follows. Test your program on at least these inputs: Hint: use type (X) is tuple to check if the input X is a tuple or not