Regular and Context Free languages

Question

Are Regular Languages are the subset of Context free languages?

Because in Chomsky Hierarchy Set of Regular Language lie at innermost stage which leads to the concept that regular languages are the subset of Context free languages..

 

But a*b* is regular and a^nb^n is context free. From this we can conclude that Context free languages are subset of regular languages ..

 

Please Help me to figure out the exact concept.. I'm confused!!

Comments

Yes RLs are subsets of CFL. Read the selected ans to this question which will clear your doubts : https://stackoverflow.com/questions/16723185/is-ab-regular 

---

Thank a lot  sir for the link you provided !!

But then what is the significance of Chomsky Hierarchy?