Regarding programming in C

Stack allocation

Allocation describes the reserving of memory for a program. Stack allocation is the fastest variant. While the C standard makes no assumption on what memory is allocated on the stack, it is reasonable to assume that arrays of static size are allocated on the stack.

Write a program employing the following allocation pattern

int size $=10$; int as$[$size$]$; for $($ size$\_$t ix $=0$; ix $<$ size; $++$ix $)$ as$[$ix$]=0$; printf$("\%$d

$",$ as$[0])$;

Make sure that you place the declaration of the array in the main function $($as opposed to global scope$).$

Compile and run the program. Then increase the size of the array, recompile and run, until the program fails with a segmentation fault. Explain this behavior assuming that that allocation was performed on the stack.