Hello, I need help solving these two computer science questions.

1) Give an FA which accepts only binary strings of length 3.

2) For each RE, state which of the following strings is in the language of the RE: , abba, bababb and baaaa.

(a) (a+b)^*ab(a+b)^*

(b) b*ab^*ab^*

(c) a+(a^*b)^*