Language Accepted by a Turing Machine with a Useless State? What language is accepted by a Turing machine which has a state that it does not enter on input I?

Specifically,

1.If the accept state is the state that it never enters then should L={empty}?

2.If the reject state is the state that it never enters then should L={everything}?

3.What if the TM has multiple accept/reject states?

4.What if the state that it never enters is neither the reject nor accept states? How does that affect L?

I have searched around and I have found a couple threads that helped prove that this problem is undecidable but is it Turing-recognizable? Co-Turing Recognizable? Both?
The definition of the language accepted by a Turing machine is valid for all Turing machines, whether they have useless states or not. Absolutely nothing changes. If there is a useless state, removing it wouldn't change the language accepted by the machine, as does adding another useless state.

Consider a similar question about C programs. What if I have a function which is never called? Does this affect the way the program executes? It doesn't.1 The same holds for Turing machines.

1Actually it might, since you might run out of memory a tiny bit faster.