A Turing machine is a mathematical model of computation that defines an abstract machine, which manipulates symbol on the strip of tape according to tables of rules.opt a is correct
since it has an infinite memory tape, which is divided into the discrete cell. From this statement we can say that TM is powerful than FA.opt b is correct.
It can perform user-specified instruction such as
1.write or read
2.moves left or right.
3.it can proceed to the subsequent instruction or halt the computation
opt c is correct.
so all are correct.The answer is opt d.