4 Segmentation fault questions in C.

The call stack is part of main memory that is reserved for function calling. Like all computer memory it is finite, so can be exhausted resulting in a stack overflow. Recursive functions allocate space on the stack for each recursive call: if there are many such recursive calls a stack overflow can result. The questions that follow ask you to investigate recursive functions and stack overflows. Note that when running programs in the Linux terminal a stack overflow results in a segmentation fault. a) Using C code write a recursive function that is equivalent to the iterative function shown below that prints the numbers from 1 to the largest possible integer value. Note that the constant INT_MAX is contained in the limits.h header file. void overflow() { for(int i = 1: i