Hello please answer I will rate thumbs up

(4) We can define a restricted PDA M as one that can increase the length of the stack by at most one symbol in each move. In other words, changing the definition of d to 8:Q (EU{2}) T +2Qx(ITUTUA) Show that for every PDA M, there exists such a restricted PDA M such that L(M) = L(M) (i.e., the two models are equivalent)