Suppose L is a context-free language and L' is regular. Show that L∩ L' is a context- free language. Specifically, if you're given a PDA diagram of L and a DFA diagram for L' , describe informally how to draw a PDA diagram for L∩ L'.
[... it's even better if you can describe the construction of L∩ L'formally but you don't have to.]