The door can be unlocked by either bit sequence 010 or 100. initially the door is locked. combin will have a new bit value every cycle. after either sequence has been input, the door will become unlocked and stay unlocked until lock_in is high. this event will lock the door and clear any input combination history. a. (10) design a moore state machine and draw the state diagram b. [10] derive the state table c. [10] using a naive state assignment (i. e. your first state +000, second state +001, third state +010 etc), derive the next state equations for each bit (i. e. qet = count the number of literals used over all the next state equations. d. [10] using a state assignment that maximizes the number of 1s for the most common states, derive the next state equations for each bit (i. e. qot = count the number of literals used over all the next state equations