I just need the diagram for the following:

Matching-Opponent is a simple two-player game where players simultaneously submit a number. In each round, players simultaneously submit either the number 0 or the number 1. Each player has a different objective to be declared winner. . Player A's goal is to match the input of Player B two times in a row and then to not match for one turn. (MATCH -> MATCH -> NO MATCH) .Player B's has a similar but different set of goals. In order to win, player 2 must not match player 1's input for one turn and then match the input of player 1 for two turns in a row. (NO MATCH - > MATCH-> MATCH) Your job is to build a FSM to track the state of the game. Your finite state machine should take two 1-bit data inputs ('a' and 'b') which correspond to the numbers submitted by each player. When either of the players wins, your FSM should output a 1 on the winner's output signal (i.e, A-1 if player A wins, B-1 if player B wins) and remain in that win state for the rest of time. start Matching-Opponent is a simple two-player game where players simultaneously submit a number. In each round, players simultaneously submit either the number 0 or the number 1. Each player has a different objective to be declared winner. . Player A's goal is to match the input of Player B two times in a row and then to not match for one turn. (MATCH -> MATCH -> NO MATCH) .Player B's has a similar but different set of goals. In order to win, player 2 must not match player 1's input for one turn and then match the input of player 1 for two turns in a row. (NO MATCH - > MATCH-> MATCH) Your job is to build a FSM to track the state of the game. Your finite state machine should take two 1-bit data inputs ('a' and 'b') which correspond to the numbers submitted by each player. When either of the players wins, your FSM should output a 1 on the winner's output signal (i.e, A-1 if player A wins, B-1 if player B wins) and remain in that win state for the rest of time. start