In Python, implement add_d_leaves, a function that takes in a Tree instance t and mutates it so that at each depth d in the tree, d leaves with labels v are added to each node at that depth. For example, we want to add 1 leaf with v in it to each node at depth 1, 2 leaves to each node at depth 2, and so on.

Recall that the depth of a node is the number of edges from that node to the root, so the depth of the root is 0. The leaves should be added to the end of the list of branches.

Tree class:

def add_d_leaves(t, v): "n "Add d leaves containing v to each node at every depth d. >>>t1Tree(1, CTree(3)]) >>> add_d_leaves(t1, 4) >> t1 Tree(1, [Tree(3, [Tree(4)])]) >>>t2Tree(2, [Tree(5), Tree (6)]) >>> t3Tree(3, [t1, Tree(0), t2]) >>> add_d_leaves(t3, 10) >>>print (t3) 4 10 10 10 10 10 2 10 10 10 10 n 1t "YOUR CODE HERE*