Asequential circuit has one input (k) and two outputs (h1, h2). an output h1=1 occurs every time the input sequence 011 is completed provided that the sequence 100 has never occurred. an output h2=1 occurs every time the input 011 is completed. a) draw the state diagram for this state machine. b) write the truth table. c) use k-maps to find the minimal next-state equations and output equations. d) implement the state machine using logic gates in logicworks to demonstrate that it simulates correctly. e) implement the state machine using a pla in logic works and demonstrate that it simulates correctly.