Question 6: Illustrate a finite state machine/diagram that accepts a string that meets the following criteria:

1. does not start with a

2. contains an instance of the pattern acbc

3. does not end with c

Question 7 uses a 3-bit "counter" that outputs the following repeating pattern: 2, 5, 1, 7, 4, 0, 6, 3 ...

1. Create a state table for your transitions. Use the convention of S for starting states and N for next states.

2. Create the Karnaugh bit maps and the minimal transition functions for the state table.

3. Create a circuit that implements this counter using JK flip-flops.