I need the answer for question 2 only

I have attached the figure 2.43e

1. Let {0, l). Give an FA (finite automaton) that accepts the language consisting of the set of all strings over that contain the substring 10 and have last character a 1. (Note that 10 and 1 are two examples of strings that are not in L, but 10101 is an example of a string that is in L.) Also, what is "(go, 101) for your FA (where go is your initial state and is the transition function for your FA)? a regular expression that corresponds to the language accepted by the FA in Figure 2.43e on p.78. 3. Let {b, e). Give an FA (finite automaton) that accepts the language corresponding to the regular expression (bb)"c+ b. Also, what is "(go, bbc) for your FA (where go is your initial state and is the transition function for your FA)