1. Here is a finite automaton: Which of the following regular expressions defines the same language as the finite automaton? Hint: each of the correct choices uses component expressions. Some of these components are: cach of the correct choices u 1. The ways to get from A to D without going through D 2. The ways to get from D to itself, without going through D 3. The ways to get from A to itself, without going through A. It helps to write down these expressions first, and then look for an expression that defines all the paths from A to D. O a) ((01+10) (11)*0)* (01+10) b) (01+10) (0(01+10))*(11)* O c) (01+10) (11*+0001+10))* O d) (01+10) (11+0 (01+10)*