# Can the complement of an unrecognizable language be a recognizable language?

I know that complement of a language that is recursively enumerable, but not recursive, is definitely not recursively enumerable (or unrecognizable). So my question is what can be said about the complement of an unrecognizable language?

Sure: the Halting language (sometimes called $$K$$) is recursively enumerable whereas its complement ($$\overline{K}$$) is famously not.