How would the classes of regular, context-free, decidable, and Turing-recognizable languages relate to each other

I’m a bit confused as to how they relate to each other. I think I understand them individually but not sure how they would relate.