Consider the NPDA < Q = {q₀, q₁, q₂}, Σ = {0, 1}, Γ = {0, 1, ⊥}, δ, q₀, ⊥, F = {q₂} >, where (as per usual convention) Q is the set of states, Σ is the input alphabet, Γ is the stack alphabet, δ is the state transition function, q₀ 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 automaton?