4 Construct a one tape deterministic Turing machine R that reduces the language L- x(xy) to Q-(aa)_ Do not solve the membership in L problem: do a reduction. a) Write what it means for R to reduce L to Q. Use the “if, and only, if” description of reduction employed in the text. b) Briefly describe the strategy of your reduction machine. c) What will be the result of your machine for the following inputs.
OR
OR