Consider the npda M = ({q₀, q₁, q₂}, {a, b}, {0, 1, Z}, d, q₀, Z, {q₂}) with transitions

d( q₀, b, Z) = { (q₁, 1Z), (q₂, Z) }

d( q₁, b, 1) = { (q₁, 1) }

d( q₁, a, 1) = { (q₁, 0) }

d( q₁, a, 0) = { (q₂, l) , (q₁, 0)}

a) List three strings accepted by M

b) Verbally describe the language L(M).

c) Is L(M) a regular language? If it is give a regular expression r such that L(M) = L(r).