Given Context Free Grammar Write Constrained Regular Expression Describes S Tu Sv V Abv N Q10967023

a. Given this context free grammar write out a constrainedregular expression it describes.

S ->   TU | SV

V -> abV | null

T -> cTc | c

U -> dU | null

b. Given the grammar found, generate a push-down automata thataccepts that language.