(Solved): 12. Calculate the space complexity of the algorithm below assuming the variables are integers with ...

12. Calculate the space complexity of the algorithm below assuming the variables are integers with 4 bytes memory each. Algorithm: SUM OF A \& B Step 1 - START Step \( 2-C \leftarrow A+B+10 \) Step 3 - Stop Your answer 15. Identify the base case and how many times the recursion functions is called in the code snippet below void my_recursive_function(int \( \mathrm{n} \) ) \{ if \( (n==0) \) return; \( \operatorname{printf}(" \% \mathrm{~d} ", n) ; \) my_recursive_function \( (n-1) \); \} int main() \{ my_recursive_function(10); return \( \theta \); \}