Question on turiing machine


#1

L = {<M,w> | M accepts w}, M is a TM and w is a string. Which of the following is true?
A)L is recursive
B)L is not recursive enumerable
C)L is context sensitive
D)L is recursive enumerable but not recursive


#2

Option A


#3

Given problem can be reduced to state entry problem and i don`t think this is recursive because there is no HTM which will halt and give result if another string which is not accpetable by this Tm is it Correct me please?