Design a pda recognizing each of the following languages:
(1) {w | w = a nb n , n is odd}
(2) {w | w = w r and length of w is odd }
(3) {w | w = a nb 2n , n ≥ 1 }
(4) {w | w = a nb n+mc m, n ≥ 0, m ≥ 1 }
(5) {w | w = a 2nb 3n , n ≥ 0 }
(6) {w | w = a nb m, n ≥ 1, m ≥ 1 and n 6= m }

walter needs to make at least 5 more cookies but no more than 40. 5 ≥ x ≥ 40;

step-by-step explanation:

walter has to make a minimum of 20 cookies. he already has 15 cookies made, so he must make 5 more to meet the minimum.

the maximum amount of cookies he can make is 55. he already has 15, so he has to make no more than 40 more cookies to meet the maximum.

c

-by-step explanation:

it would be c

answer: 0.1,0.85

step-by-step explanation: