What language is accepted by the pushdown automation

M = ({q₀, q₁, q2}, {a, b}, {a, b, z}, δ, q₀, z, {q₂})

with δ(q₀, a, a) = {(q₀, aa)}; δ(q₀, b, a) = {(q₀, ba)}

δ(q₀, a, b) = {(q₀, ab)}; δ(q₀, b, b)  = {(q₀, bb)}

δ(q₀, a, z) = {(q₀, az)}; δ(q₀, b, z) = {(q₀, bz)}

δ(q₀, λ, b) = {(q₁, b)}; δ(q₀, λ, a) = {(q₁, a)}

δ(q₁, a, a) = {(q₁, λ)}; δ(q₁, b, b) = {(q₁, λ)}

δ(q₁, λ, z) = {(q₂, z)}?

The language accepted by the pushdown automation M is the set of all strings that can be generated by the transitions defined in the transition function δ, starting from the initial state q0, and eventually reaching the accepting state q2. The input alphabet for the language is {a, b}. The stack alphabet for the language is {a, b, z}.

The language accepted by the M is L = {wwR | w Є {a, b}+} and the transition diagram is given below.