Table Q4(a) shows the flow table for an asynchronous sequential finite state machine (FSM). z is the output and w and w are the input. A, B, C and D are the state names. Present state A B D ww1 Next state 00 01 A A A D A D Table 04(a) 10 11 A C B A (B B C) B Output Question 4a(ii) The following state codes is assigned to all four states. 0 0 1 Question 4a(i) Complete the re-label flow table in Table Q4(a)(i) given in Appendix C by replacing the state name in the next state columns with suitable transition number. (2 marks) State A = 00, B = 01, C = 10 and D = 11. Use transition diagram and identify the transition(s) which is(are) problematic. You need to label the state code and transition number clearly in the transition diagram. (8 marks) Question 4a(iii) Present the modified flow table that is free from the problematic transition(s) identified in Question 4a(ii). (4 marks) APPENDIX C Question 4a Present State A B C D W2W1 = 00 Next State 01 10 Table 04(a) Re-label flow table 11 Output Z