Let A$,$ B$,$ and C be languages over some alphabet $\backslash$Sigma $.$ For each of the following

statements, answer $$yes$$ if the statement is always true, and $$no$$ if the statement is

not always true. If you answer $$no$,$ provide a simple counterexample. $($Note: Some

statements $$look true,$$ but are not $($and vice versa$).$ You need to really think about

the language operations.$)$