What are all the decidable languages that can be constructed using a turing machine with only the Reject and Accept states? What languages can be decided by a two-state TM that has two states: one accepting and one rejecting?

As a newbie in TMs, there are some definitions I am not familiar with, of which the answer is obviously dependent,  like:


Can we draw an outgoing arrow from the Accept or Reject states?
Can either of these two states be the starting state?
If there are only two states, the rejecting state and the accepting state, then the machine must start in one of those states. That means it must immediately halt, which should tell you what language it can accept.