1. Suppose that L is such that there exist a Turing machine that enumerates the elements of L in proper order. Show that this means that L is recursive

2. Show that the families of recursively enumerable and recursive languages are closed under reversal.

thank you