Peter Linz Edition 4 Exercise 7.2 Question 15 (Page No. 195)

Question

Find a context-free grammar that generates the language accepted by the npda $M =$ ({$q_0,q_1$}, {$a,b$}, {$A, z$}$,δ, q_0, z,$ {$q_1$}), with transitions
                            $δ(q_0, a,z) =$ {$(q_0, Az)$},
                            $δ (q_0,b, A) =$ {$(q_0, AA)$},
                            $δ(q_0, a, A) =$ {$(q_1,λ)$}.