Assumptions for this exercise

$.$

$.$

$.$

$-$

$$Alphabet

$\backslash$

Sigma

$=$

$\{$

a

$,$

b

$\}$

$-$

$$For any string w over

$\backslash$

Sigma

$$

$$

$,$

n

a

$$

$$

$($

w

$)$

$=$

$$the number of a

$\text{'}$

s in w

$.$

$$To do in this exercise

$.$

$.$

$.$

$-$

$$Use JFLAP to define a Grammar G such that L

$($

G

$)$

$=$

$\{$

w in

$\backslash$

Sigma

$$

$$:n

a

$$

$$

$($

w

$)$

$>$

$=$

$2$

$\}$

$.$

$-$

$$Save your Grammar as a file having filename extension, and examples that should pass are aba and aaa.