Problem $4$

For languages L$1$ and L$2,$ define L$1/$L$2=\{$w $|$ wx in L$1$ for some x in L$2\}.$ Prove that if L$1$ is context$-$free

and L$2$ is regular, then L$1/$L$2$ is context$-$free.

states as strings in our Python function:

Q $=\{"$q$\_0","$q$\_1","$q$\_2","$q$\_3"\}$