Given the formal definition of the finite state machine (FSM): M1= { {A, B}, {a,b}, { ((A,a),A), ((A,b),A), ((A,b),B), ((B,a),C) } , A, {C} } · Convert M1 from a non-deterministic FSM into a...

Given the formal definition of the finite state machine (FSM):
M1= { {A, B}, {a,b}, { ((A,a),A), ((A,b),A), ((A,b),B), ((B,a),C) } , A, {C} }
·        Convert M1 from a non-deterministic FSM into a deterministic FSM.
Draw them both (non-deterministic and deterministic FSMs in STD) and write the State Transition Table and the formal definition of the deterministic FSM.