I have a question regarding regular languages. Given that L1 and L2 are non regular languages, can a regular language L exist so it is a subset of L2 and L1 subset of L?

To be more specific:

$L1 \subset L \subset L2$

L1,L2 non regular Languages

I have a question regarding regular languages. Given that $L_1$ and $L_2$ are non-regular languages, can a regular language $L$ exist so it is a subset of $L_2$ and $L_1$ subset of $L$?

To be more specific:

$\qquad L_1 \subset L \subset L_2$

for $L_1, L_2$ non-regular Languages.

I recently learned at my Uni about regular languages and regular expressions and I have the following question. Given that L1 and L2 are non regular languages  , can a regular language L exist so it is a subset of L2 and L1 subset of L?

To be more specific:

L1 < L < L2

L1,L2 non regular Languages

'<' means subset of

I have a question regarding regular languages. Given that L1 and L2 are non regular languages, can a regular language L exist so it is a subset of L2 and L1 subset of L?

To be more specific:

$L1 \subset L \subset L2$

L1,L2 non regular Languages