regular language

Let L⊆{0,1}. Which of the following is true?

  1. If L is regular, all subsets of L are regular.
  2. If all proper subsets of L are regular, then L is regular.
  3. If all finite subsets of L are regular, then L is regular.
  4. If a proper subset of L is not regular, then L is not regular.
1Comment
shivani @shivani1234
28 Oct 2017 01:23 pm

If all finite subsets of L are regular, then L is regular. // true 
but the statement regular language has got its finite subset as regular is  not true.

You can analyse these statements by taking examples.