Consider the alphabet ? = {a, b}. Give the deterministic FAs that accept the languages below in problems 1, 2, and 3. Briefly explain the idea underlying each FA.

1. L1 = ??

2. L2 = ?? ??

3. L3 = {w|w ? ?? and |w| is a multiple of 4}