15A language is decidable if:ASome Turing machine accepts it but may loopBA Turing machine halts on every input and accepts exactly its stringsCIt is infiniteDIt is regular onlyView AnswerWorkspaceReportSaveEasy