Problem 2. [10 points] Using the graphical language described in the class notes, write a turing machine on input alphabet - (a,b, c) that takes input w and outputs wwR. That is, a machine that starts in configuration (s, #w#) will end in configuration (h, #wwR#)