Create PDAs for the following languages. For the first two, give formal definitions of the PDA in addition to the transition diagram.

a) L = {a^m b^m cⁿ, m and n >0}

b) L = {a^m bⁿ: m>= n-5}

c) L = {w belongs to {a,b}*: w has twice as many as as bs}

Create PDAs for the following languages. For the first two, give formal definitions of the PDA in addition to the transition diagram.

a) L = {a^m b^m cⁿ, m and n >0}

b) L = {a^m bⁿ: m>= n-5}

c) L = {w belongs to {a,b}*: w has twice as many as as bs}

In this part c), after designing your PDA, give the execution trace of the string aaaabb by showing your stack and execution.

In this part c), after designing your PDA, give the execution trace of the string aaaabb by showing your stack and execution.