An asynchronous finite state machine has two inputs X1 and xo and one output Z. It operates according to the primitive flow table shown in Figure 4. X1 Xo 00 01 11 10 Z (1) 2 (2) 3 4 (3) (4) 50 6 (5) 1 1 (6) 1 Figure 4 OOOON a) Explain what is meant by the term "primitive flow table" and describe its main features. What is fundamental mode and how assuming this mode may help system designers? [5 marks] b) Minimize the number of states in this state machine and show how this minimum is obtained. [7 marks] c) Produce a race-free assignment of state codes. Show the methods used to check for and, if necessary, mitigate races. What are races, why they may exist and why should they be eliminated? [9 marks] d) Derive the logic equations needed to implement this machine. An asynchronous finite state machine has two inputs X1 and xo and one output Z. It operates according to the primitive flow table shown in Figure 4. X1 Xo 00 01 11 10 Z (1) 2 (2) 3 4 (3) (4) 50 6 (5) 1 1 (6) 1 Figure 4 OOOON a) Explain what is meant by the term "primitive flow table" and describe its main features. What is fundamental mode and how assuming this mode may help system designers? [5 marks] b) Minimize the number of states in this state machine and show how this minimum is obtained. [7 marks] c) Produce a race-free assignment of state codes. Show the methods used to check for and, if necessary, mitigate races. What are races, why they may exist and why should they be eliminated? [9 marks] d) Derive the logic equations needed to implement this machine