Design a binary counter capable of counting to at least 84, the number of students in this class. It's OK to have excess capacity. The counter should increment on the rising edge of an input signal we'll call COUNT. Another input called CLEAR should have the effect of setting the counter to zero if CLEAR = 1 when COUNT is asserted. Note that the counter should only change state, either to increment the count or clear to zero, on the rising edge of COUNT. You may use combinatorial logic gates and D flip flops. It is not necessary to display the output; just implement the counting engine.