[20 pt; 10 pt each] State and prove whether the languages SUB3RE (R, S,T) |R, S,T are regular expressions and L(R)UL(S) S L(T)) HALTTM = {(M, w) | M is a TM that halts on input w} have any of the following properties (recall that they could have more than one): DEC: Decidable TR: Turing Recognizable co-TR: co-Turing recognizable NTR: not Turing recognizable NcoTR: not co-Turing recognizable