PYTHON PROGRAMMING

5 annoying_tree_of_tuples (n) In annoying_recursion. py , write the function annoying_tree_of_tuples (n) , which builds a nested \"tree\" of tuples. For n=0, simply return the value 0 (not in a tuple). For all higher values of 11, return a tuple with three elements, which are: a The value returned for 11-1 o n o The value returned for 111, 3. second time Thus, n=1 should return (0 , 1 , 0), n=2 should return ((0, 1 ,0) ,2 , (0, 1 ,0) ), and so on