Convert the following push down automaton P to a context free grammar.
P = ({q,p}, {0,1}, { Zo,X}, δ, q, Zo, {p}), where o is given by
δ(q,0,Ζο) = {(q, X Zo)}
δ(q,0,X) = {(q, XX)}
δ(q,1,X) = {(q, X)}
δ(q, ε, X) = {(p, ε)}
δ(p,1,X) = {(p, XX)}
δ(p,1,Ζο) = {(p, ε)}
δ(p,0,Z) = {(q, Z)}