It is an RE language but not REC because we need to check membership of each string. Here domain of the string is all the string. And since TM accepts nothing so we need to show that entire universe of string is rejected by TM. And we cant do that because there are infinite strings.