.4 Maximum score 15 What language is accepted by the Turing machine whose transition graph is in the figure below? g0 3.3.ค. b.b.R Q.5 Maximum score 20 Construct Turing Machine that will accept the language L-(w: wis a multiple of 3) over the alphabet (a.b). Q. 6 Maximum score 15 Design a Mealy machine for a 20 cent candy dispensing machine which accepts nickel (n) dime (d) and quarter(q).It gives candy as well change in the
OR
OR