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)}