Consider the following C function:
![436_505eb0d4-8178-4012-9ad1-f8ad46f3dfc6.png](https://secure.tutorsglobe.com/CMSImages/436_505eb0d4-8178-4012-9ad1-f8ad46f3dfc6.png)
a. Convert the recursive function into a nonrecursive function. Assume Sigm a () will always be called with a nonnegative argument.
b. Exactly 1 KB of contiguous memory is available for the run-time stack, and addresses and integers are 16 bits wide. How many recursive function calls can be made before the program runs out of memory? Assume no storage is needed for temporary values.