Construct Deterministic Finite Automata for the following languages

1- The set of strings over {a, b} where each pair of as immediately succeeds a pair of bs.

2- {w|w accept strings over {0, 1} which satisfy even parity in length 4 blocks.}