What are all the decidable languages that can be constructed using a turing machine with only the Reject and Accept states?
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.