1. If C is any set of regular languages then union C is a regular language
2. Every subset of regular language is regular
3. L = {XYX | X,Y belongs to sigma*} is regular
4. A and B are two Regular languages then A/B {W| W is in A but not in B} is regular
which of the following is true ?