L1 = ∑* = {∈, a,aa,aaa,..... b,bb,bbb,.........c,cc,ccc,..... , ab,aabb,ba,bbaa,bbab,aaba,..... cb,ccbb,bc,ccbcc,... ac,aacc,acacb,....abc,cba,cab,......} ===> it have regular expression = (a+b+c)* ====> it is RL
L2 = { an . bn . cn | n > 0 } ===> it doesn't have Regular expression ===> it is not RL
But L1 ⊃ L2
Note that :-
1) Subset of Regular language is need not to be Regular
2) Superset of Non-Regular language is need not to be a Non-Regular.