Design a Mealy state machine that will detect....

So I have the answer key for this problem, but I just do not understand how they arrived at the answer. I do not understand the next states or output parts. if someone can clearly explain what is going on, I would greatly appreciate the help!

Problem 10) Design a Mealy state machine that will detect a 1010 sequence from an input s with overlap (e.g. the following stream of bits will cause the sequence to be detected twice: "101010") Fill in the state table (the starting state is 00 and they are subsequently named in numeral order.) Make sure to use don't cares to fill in the implementation columns, when nossible. Once you have the state table, calculate the next state logic for D1 and DO. and output logic for z using K-maps. Finally, draw the state machine circuit. Use D flip-flops for state memory. It may be useful to first construct a state transition diagram but only the state table will be graded. Note that the following page is available to you for additional workspace for this problem. State Table Present State Input Next State Output Flip Flop Inputs Q1 QOs Q1* QO* Z D1 DO 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 0 ooooooo 1 0 1 1 1 1 0 6 TOOT 0 Next State Logic: III Output Logic: State Machine Circuit