Find the Finite Automaton $($F$.$A$.)$ and Regular Expression $($R$.$E$.)$ that define the intersection $($L$1$ L$2)$

for the following regular language pairs.