Convert the following push down automaton $P$ to a context free grammar.

$P=(\{q,p\},\{0,1\},\{Z_0,x\},,q,Z_0,\{p\}),$ where $$ is given by

$(q,0,Z_0)=\{(q,x{Z}_0)\}$

$(q,0,x)=\{(q,xx)\}$

$(q,1,x)=\{(q,x)\}$

$(q,,x)=\{(p,)\}$

$(p,1,x)=\{(p,xx)\}$

$(p,1,Z_0)=\{(p,)\}$

$(p,0,Z)=\{(q,Z)\}$