Determine, with proof, which of the following languages are undecidable. That is, for a undecidable language, present a proof via Turing reduction of its undecidability, and for adecidable language, exhibit a decider for that language.(a)LALTERNATE={x: neither 00 nor 11 is a substring ofx}(b)LEVEN={〈M〉:|L(M)|is even}(c)L376−HALT={(〈M〉, x) :Mhalts onxin|x|376steps}(d)LQUICK−HALT={〈M 〉: There is an input such that halts on within|w|steps}Hint: See hint in Question 1