SOLVED: Stack InitializationAssuming that the stack is held in an array S[1..N] indexed by the variable i. If the variables below are properly initialized, and if all accesses to S respect the array bounds, then the code below implements the stack operations Push and Pop. Note:Push: begins[i] = x; i := i 1;Pop: i := i - 1; xs[i];Which of the following statements correctly initializes i for this implementation of a stack?Pick ONE option:a) i = N 1b) i = N - 1c) i = 0d) i = 1