A 4-bit Johnson counter advances through the sequence D C B A = 0000,1000,1100,1110,1111,0111,0011,0001, and repeats. Show how to implement the Johnson counter using T flip-flops. Fill-in the Remapped FF inputer and K-maps, and show a schematic for the minimized sum of pruducts implementation of the Next State function. You may assume that an external reset signal places the counter in state 0000 when asserted. DO NOT make the counter self-starting.