(Solved): P1 (25 points): This problem concerns the algorithmic state machine (ASM) chart shown below: A: Wh ...

P1 (25 points): This problem concerns the algorithmic state machine (ASM) chart shown below: A: What are the inputs to this state machine? B: What are the outputs to this state machine? C: Draw the state diagram that represents this state machine. D: Make state assignments as follows: \( \mathrm{A}=00, \mathrm{~B}=01, \mathrm{C}=10 \), and \( \mathrm{D}=11 \). Derive output expressions for this ASM chart using DFFs, AND gates, OR gates, and NOT gates. E: Show that the next state expressions can be written as: \[ S_{1}^{\text {new }}=\left(\bar{Z}+S_{0}\right) \overline{\left(Z S_{1}\right)}, S_{0}^{\text {new }}=\left(\bar{Z}+\overline{S_{0}}\right) \overline{\left(Z S_{1}\right)} \]