Following are some description of TM/algorithm behaviour. Select all that exist.1 pointLoops on all inputsHalts on all inputsDecides HALTSDecides HALTS'Halts on exactly and only the strings in the language HALTSHalts on exactly and only the strings in the language HALTS'

Select all true statements1 pointThere is a TM that loops on all inputsLet A be any decidable language. There is a TM that loops on exactly the strings not in A.Let A be any decidable language. There is a TM that loops on exactly the strings in A.There is an undecidable language A such that there is a TM that halts on exactly the strings in A.There is an undecidable language A such that the complement of A is decidable.There is a decidable language A such that the complement of A is undecidable.

Consider the TM where tape alphabet is {a, b, blank} with transitions (q0, a) → (q0, a, R), (q0, blank) → (q0, blank, R), (q0, b) → (qh, b) where qh is a halting state. Select all inputs on which the TM loops.1 pointeaaaaabbbbaba

Select all languages that are known to be decidable.1 point{x}, where x is some specific string{}{x#y#xy | x and y are strings over {a, b}}HALTS = {(M, x) | M halts on input x}{x: x = aba and Goldbach conjecture is True}

Select all statements equivalent to "Language A is decidable by a TM."1 pointA is decidable by a C programA is decidable by a Python programA is decidable by a NFAA is decidable by a PDAA is decidable by a context-free grammar

A is some decidable language. Select all statements that are true irrespective of what A is.1 pointHALTS ≤ HALTS'HALTS' ≤ HALTSA ≤ HALTS'HALTS' ≤ A