Consider the NPDA < Q = {q0, q1, q2}, ∑ = {0, 1}, Γ = {0, 1,} ⊥ δ , q0, ⊥ , F = {q2} >, where (as per usual convention) Q is the set of states, ∑ is the input alphabet δ is the stack alphabet, δ is the state transition function, q0 is the initial state, ⊥ is the initial stack symbol, and F is the set of accepting states. The state transition is as follows:

Which one of the following sequences must follow the string 101100 so that the overall string is accepted by the automata?