Consider the following statements with respect to deciability.
Statement - 1: RegularTM = { <M>| M is a TM and L(M) is regular language}
Statement - 2: EQTM = {<M1, M2> | M1 and M2 are TMs and L(M1) = L(M2)}
The number of above problems that are decidable _________ .
please explain statement 1
