Consider the following two statements:

I. If all states of an **NFA **are accepting states then the language accepted by the **NFA** is

∑∗.

II. There exists a regular language A

such that for all languages B, A∩B is regular.

Which one of the following is **CORRECT**?

- Only

I is true
- Only

II is true
- Both I

and

II are true
- Both

I and

II are false

plz also tell what sigma* mean?????