please in it in 5 minutes

2 Maximum score 20 whether to count a's or b's). Q. 3) Maximum score 20 (10 each part) Build a PDA to accept the following language: {re" : x {a, b)". #dr) , n or non- (Hint PDA has to guess Let L- (a"b" n>0 and m -3k+n for some k 20. a) Show a context-free grammar that generates L b) For this grammar generate the corresponding PDA Q.4 Maximum score 10 Consider the TM: states-0, 1,2), { 0,1), Tape symbols r-{ 0,1,A), A being the blank symbol, starting state 0 and final state 2 and the following transition rules: (0,1 )(0,1 ,R); (0,0)( I ,0. R); ( 1 . 1 )( 1 , I ,R); ( I ,)(2, I ,L); (2,1 )(2,1 .L); (2,0-(2,01) and (2)(0.1,R). What is the behavior when started on the input (a) 1010 and (b) 101, with the R/W at the first non-blank symbol? Q. 5 Maximum score 15 The following is a DFA for the language of all strings in (a,b]. What is the language accepted by t DFA. Give a TM (diagram or set of rules) which will accept the same language