6) (55 points) Construct Turing machines that will accept the following languages on {a,b) (you can provide your TM either by drawing it, or by writing all the transitions of your TM) a) (15 points) L sw: |w| is even) b) (10 points) L(ala+b)) (your machine should not have more than three states) c) (15 points) L = {w. na (w) = no (w)) d) (15 points) L = {ww" }