Question $3$Miscelaneous Consider the alphabet $=\{$a$,$b$,$c$\}.$ Select all items that are correct statements: $($a$)$ Every finite language is both regular and context$-$free. $($b$)$ If every state of some PDA P is an accept state, then the language of the PDA is $.($c$)$ If a language L satisfies the pumping lemma for context$-$free languages, but not the pumping lemma for regular languages, then L is an infinite language. $($d$)$ The language L $=\{$w in $|$ w $=$ v#u$,$u is a proper prefix vR$\}$ is context$-$free. $($e$)$ If A and B are context$-$free languages, then their concatenation A $$ B is also context$-$free