closure property on Recursively enumerable language


How to prove that recursive and recursively enumerable language is closed under reversal?

Why recursively enumerable language is not closed under set difference? [But intersection of recursive and recursively enumerable language is recursively enumerable]