Given a natural number k, write a recursive function which makes a complete binary tree with 2^k leaves. The depth of such a tree equals k The data element at every leaf is zero. The data element at every node that is not a leaf is one. Draw a complete binary tree as described above for k = 3. Define the prototype for your recursive function. Describe the role of the parameter(s). What is the base case? What is the general case? Write Python code to define the function