2.47 Let = {0,1} and let B be the collection of strings that contain at least one 1 in their second half. In other words, B = {uv u Є Σ*, v E Σ*1Σ and lu > v}. a. Give a PDA that recognizes B. b. Give a CFG that generates B.

Code in C++  only. Correct answer will upvoted else downvoted.   framework of size n×m, with the end goal that every cell of it contains either 0 or 1, is considered lovely if the total in each adjoining submatrix of size 2×2 is actually 2, i. e. each "square" of size 2×2 contains precisely two 1's and precisely two 0's. You are given a network of size n×m. At first every cell of this network is unfilled. How about we indicate the cell on the crossing point of the x-th line and the y-th segment as (x,y). You need to handle the inquiries of three sorts: x y −1 — clear the cell (x,y), in case there was a number in it; x y 0 — compose the number 0 in the cell (x,y), overwriting the number that was there already (assuming any);  x y 1 — compose the number 1 in the cell (x,y), overwriting the number that was there beforehand (assuming any). After each question, print the number of ways of filling the unfilled cells of the grid so the subsequent network is delightful. Since the appropriate…

A. Give a CFG G that generates all odd length strings over {a,b}.B. Give a Push-down Automaton that accepts strings generated by G in Part a.

is ... : Consider the Universal Set U= {1,2,3,...} and sets A={1,2,5,6} „B={2,5,7},C={1,3,5,7,9} the A\C is ... * O Skip O {3,9} O {2,5} O {2,6}