5. Sketch a proof that the class of computably enumerable languages is closed under intersection. (Hint: if Mi and M2 are two Turing machines, put all states of Mi and all states of M2 into your new machine, simulate Mi on input w. What happens if M loops forever? What happens if Mi accepts? What happens if Mi rejects?)