Determining recursive enumerability of given languages
If (1) means exactly two strings of different lengths, not r.e. (2) is r.e.: guess two strings, check their lengths are different, verify that $M$ accepts both.

Use the extension to Rice's theorem to prove (1) isn't r.e.