Design a NFA $($and provide a state diagram$)$ that accepts the following languages L over the alphabet $\backslash$Sigma $=\{$a$,$b$,$c$\}.$

$1.$A NFA that accepts the language L characterized by the following regular expression: $($a$\backslash$cup b$)$c$.2.$ A NFA that accepts the language L characterized by the following regular expression: a$($bc$)$