Please answer this question as soon as possible , But kindly attempt with logical answer according to the question above, i will give you thumbs up vote for this , but if answer will be copied then i will down vote your answer

Prove or disprove that the subset of a regular language must be regular. You may use that there exists a non-regular language without proof