You are to create a well-formed Python recursive function (i.e, there must be a stopping/base case and the recursive case must present a smaller problem), along with a call to that function. You will then trace that function, showing how memory is used and provide any and all output.
You then need to present a relationship, whose domain is some subset of the integers. Finally, you need to provide a prove that the relationship holds over the entire domain by using a detailed Mathematical Induction prove.
1) You are to create a well-formed Python recursive function (i.e, there must be a stopping/base case and the recursive case must present a smaller problem), along with a call to that function.
2) Trace your function and call. Remember that you must keep track of memory for each function call and provide output.
3) Present a relationship with the domain some subset of the integers that is to be proven via Mathematical Induction.
4) Prove your relationship with the domain some subset of the integers via Mathematical Induction. Note you must detail each of the four steps and show all of your work.