2. (3 marks) Using the method described in Section 9.2 (and in class), convert the state diagram given in Figure 1 into an equivalent regular expression. Here ={a,b,c,d}. Your answer should include the intermediate step(s) used in the construction. 1 An NFA produced by some other method is considered incorrect independently of whether or not it may efine the same language