I need the answer for part C only .

The following two NFAs, G1 and G2, represent behaviors of a certain discrete-event system. In this question, you are expected to show steps of your construction method. You may use software to help you with your construction but a single screenshot of the end result, without any explanation or construction steps, will not be accepted. G1: Marks sequences that end with a suffix abc G2: Marks sequences that end with a suffix aab qo q1 q2 q3 S0 s1 s2 S3 (a) Construct a single machine G that incorporates both behaviors in G1 and G2, i.e., Lm(G)-Lm(G1) ULm(G2). (b) Construct an equivalent Deterministic Finite Automaton (DFA) for the NFA in Part (a) (c) Construct a single machine G that incorporates the common behaviors in G1 and G2, ie., Lm(G)-L(GI) n This new machine should mark sequences that end with a suffix abc or aab. This machine may be an NFA. Lm(G2) The following two NFAs, G1 and G2, represent behaviors of a certain discrete-event system. In this question, you are expected to show steps of your construction method. You may use software to help you with your construction but a single screenshot of the end result, without any explanation or construction steps, will not be accepted. G1: Marks sequences that end with a suffix abc G2: Marks sequences that end with a suffix aab qo q1 q2 q3 S0 s1 s2 S3 (a) Construct a single machine G that incorporates both behaviors in G1 and G2, i.e., Lm(G)-Lm(G1) ULm(G2). (b) Construct an equivalent Deterministic Finite Automaton (DFA) for the NFA in Part (a) (c) Construct a single machine G that incorporates the common behaviors in G1 and G2, ie., Lm(G)-L(GI) n This new machine should mark sequences that end with a suffix abc or aab. This machine may be an NFA. Lm(G2)