Design a 2-bit counter that counts the sequence 0, 1,2, 3,0, 1,2,3,0 When input x = 1 . The counter doesn't move (stays in its present state) when input x 0. Accomplish this using (a) D FF. Your solution must have the following . State Table State Diagram FF Excitation Tables K-MAP Simplification Resulting Counter Diagram