help with finite automata and regular expression

I’m working on a Computer Science exercise and need support.

hi everyone.

i need help with three questions:

1. Construct the complement FA of the following FA.

(FA in attached file)

2.Build the intersection machine for the two following languages described by the two following FAs.

(FA in attached file)

3.Prove that the language L={anb2n} is non-regular.

Full questions are in the attached file