P3 (10 points): Let us make a Moore FSM that determines if a number is divisible by three. A: Draw the state diagram for a Moore FSM that receives an input W and produces an output Z-1 only if the accumulated value V is a multiple of 3. When W is input, the new value is as follows: Vnew 2V + W. The FSM should have only three states, where each state corresponds to the value of V mod 3. B: Use your state diagram to determine if the 36-bit number 101100101111001011101101011011001010 is a multiple of 3. neww P3 (10 points): Let us make a Moore FSM that determines if a number is divisible by three. A: Draw the state diagram for a Moore FSM that receives an input W and produces an output Z-1 only if the accumulated value V is a multiple of 3. When W is input, the new value is as follows: Vnew 2V + W. The FSM should have only three states, where each state corresponds to the value of V mod 3. B: Use your state diagram to determine if the 36-bit number 101100101111001011101101011011001010 is a multiple of 3. neww