Construct a Turing machine for (0+1)*.0.1.0.(0+1)*. Q.34 Identify the optimization techniques required to optimize the following code. Also, mention the optimized code. a = 200; while(a>0) { } b = x *y; if (a % b == 0} printf("%d", a); Q. 35 Consider the following expression and construct a DAG for it- (((a+b)+(a+b)) + ((a+b)+(a+b)))