please draw the diagrams or use finsm.io

No prool is required for this question. (a) [10 points] Draw an NFA with 2 states for the following language: A=({a,b})({b,c})({a,b}) (b) [10 points] Draw an NF with 2 states for the following language: B=({a,c})({b})({a,c}) (c) [5 points] Draw an NFA for C=AB with 4 states. (d) [25 points] Use the subset construction game to create a DFA for C out of its NFA. Label each state with subsets of C