Which of the following is/are undecidable?
- AGiven two Turing machines and , decide if .
- BGiven a Turing machine , decide if is regular.
- CGiven a Turing machine , decide if accepts all strings.
- DGiven a Turing machine , decide if takes more than 1073 steps on every string.

