Prove or disprove the following.

(a) The intersection of a regular language and a non-regular language is always regular.

(b) Each context-free language is generated by exactly one CFG.

(c) A finite language has no pumping length.

(d) A finite language must be context-free.

1. Prove or disprove the following. (a) The intersection of a regular language and a non-regular language is always regular. (b) "Each context-free language is generated by exactly one CFG." c)"A finite language has no pumping length." (d) "A finite language must be context-free