ONLY need B and C. Details and steps appreciated. Thanks!

Draw a transition diagram for an FA that accepts the string abaa and no other strings. For a string x elemento {a, b}* with |x| = n, how many states are required for an FA accepting x and no other strings? For each of these states, describe the strings that cause the FA to be in that state. For a string x elementof {a, b}* with |x| = n, how many states are required for an FA accepting the language of all strings in {a, b}* that begin with x? For each of these states, describe the strings that cause the FA to be in that state