fLet $\backslash$Sigma $=\{$a$,$ b$\}.$ Construct a regular expression defining each of the following languages

over $\backslash$Sigma $.$

$($i$)$ The language of all words that do not begin with ba$.$

$($ii$)$ The language of all words in which the total number of b$$s is divisible by $3$ no matter

how they are distributed, such as bbabbaabab.