Please help with some questions - formal language and auto theory. Thanks!

Question2 10 pts Let x, y, z be positive integers (x, y, z> 0) represented in unary. Assume that x > z. Design a Turing Machine (TM) that computes the function f(x,y,z)=x+y-z. More specifically, Draw the transition graph of the TM. Make sure you clearly indicate the initial and final states. Do not draw the block diagram! Here is an example of a computation performed by the TM: if x = 5, y = 2, z = 4 then Upload Choose a File