![3. Draw the simplest possible (i.e. with fewest number of states) NFA which accepts the following language over the alphabet of fa, e, i, o, u, b, p, r, s, t]: the set of strings which start with a consonant, then one or more vowels, then a consonant, and after reading any sequence of 0 or more symbols from the alphabet, eventually ends with the same vowel that preceded the second](https://d2vlcm61l7u1fs.cloudfront.net/media%2F222%2F222151bf-7577-451c-b2ad-6d6fe44c6b1d%2Fphp4X8UYn.png)
3. Draw the simplest possible (i.e. with fewest number of states) NFA which accepts the following language over the alphabet of fa, e, i, o, u,
PayPal Gateway not configured
PayPal Gateway not configured
![3. Draw the simplest possible (i.e. with fewest number of states) NFA which accepts the following language over the alphabet of fa, e, i, o, u, b, p, r, s, t]: the set of strings which start with a consonant, then one or more vowels, then a consonant, and after reading any sequence of 0 or more symbols from the alphabet, eventually ends with the same vowel that preceded the second](https://d2vlcm61l7u1fs.cloudfront.net/media%2F222%2F222151bf-7577-451c-b2ad-6d6fe44c6b1d%2Fphp4X8UYn.png)
3. Draw the simplest possible (i.e. with fewest number of states) NFA which accepts the following language over the alphabet of fa, e, i, o, u,
PayPal Gateway not configured
PayPal Gateway not configured