Turing machines provide a powerful computational model for solving problems in computer science and testing the limits of computation. Q2. 9 marks A. Design a Turing machine that decide the following languages over the alphabet {0,1}, L= {w|w contains twice as many Os as Is}. B. Construct a Turing machine to do the following: consider a machine that stats on tape that contains nothing but a string of l's. The machine should be started on the left end of the string. This machine is designed to multiply the length of the string by 2. C. A={ | R is a regular expression describing a language containing at least one string w that has 111 as a substring (example W = x11ly for some x and y)}. Prove or disprove that A is decidable by using Turing machine.