Showing $A-B$ is a CFL where $A$ is a CFL and $B$ is finite Show that if $A$ is a context-free language and $B$ is finite, then $A - B$ is a context-free language.


I'm just not sure how to use their properties to formally show this. Thanks for all the help in advance.
Hint: If $A$ is context-free and $R$ is regular then $A \cap R$ is context-free.