1. [20 pts] Consider the following circuit:

1. Analyze the following asynchronous network using a flow table. Starting in the stable total state for which X=Z=0, determine the state and the output sequences when the input sequence is X=0, 1, 0, 1, 0,...
2. Find any critical races that are present in the table.

2. [30 pts] (a) Show a Merger Diagram for the Primitive Flow Table shown below.

(b) Show a Merged Flow Table for the design.

(c) Obtain a race-free state assignment for the merged flow table shown below. You are to assign the codes for the two unassigned states and you may not use any additional states to implement the race-free assignment. Show your solution by filling in all fields (including a glitch-free output assignment for Z) on the empty table shown below.