You are the central hub for a communication system. Messages come to you as sequences of As, Bs and Cs but coded in binary. Each such binary message is to be followed by a check digit. This is a final 0 or 1 so that the entire binary message satisfies your parity property.

If the parity is Even 1 then the entire message (including the check digit) has an even number of 1's

For example, if your codes are A = 101, B = 1101, C = 001 and your parity property is Odd 0, the message ABAC would get encoded as 10111011010011. The final character is the check digit. It is a 1 because we want an odd number of 0s. So 10111011010011 is valid, but 10111011010010 and 10111011011100 are not. Given,

A =	B =	C =	PARITY =
00000	1101	1000	Even 1

Design a binary finite state automaton (FSA) to accept all strings that represent valid messages (for your particular codes and parity property) and reject all others. This FSA must be DETERMINISTIC, REDUCED and must be in STANDARD FORM.