One-hot FSM logic (2012 q2)

The FSM of the previous problem is to be implemented with a one-hot encoding using six flip-flops y[6:1], where y[1] = state A, y[2] = B, y[3] = C, y[4] = D, y[5] = E, and y[6] = F. The transitions, for reference:

Present state	Next state if w=0	Next state if w=1
A	A	B
B	D	C
C	D	E
D	A	F
E	D	E
F	D	C

Derive, by inspection (each next-state signal is the OR over all incoming transitions of present-state bit AND input condition), the combinational logic for Y2 and Y4 — the next-state inputs of flip-flops y[2] (state B) and y[4] (state D).

Your logic will only ever be tested with valid one-hot values on y[6:1].