Turing Machines & Undecidability

Show that the following two languages are both undecidable (use reduction)

a) A = { | M is a Turing Machine. If M accepts aab, then M accepts baa.}

b) B = { | M is a Turing Machine that moves left when the head is positioned three cells to the left of the first cell containing some input string x}