2. When we convert an automaton to a regular expression, we need to build expressions for the labels along paths from one state to another state that do not go through certain other states. Below is a nondeterministic finite automaton with three states. For each of the six orders of the three states, find regular expressions that give the set of labels along all paths from the first state to the second state that never go through the third state. Then identify one of these expressions from the list of choices below. a) 1(0+1010)* represents the paths from C to A that do not go through B. O b) (10)*1 represents the paths from C to B that do not go through A. c) 1+101 represents the paths from C to B that do not go through A. d) O represents the paths from B to A that do not go through C