Identify all possible strings of length five within the language defined by the

Identify all possible strings of length five within the language defined by the regular expression L((a+bb)∗)L((a+bb)∗).Design a non-deterministic finite automaton (NFA) that recognizes strings belonging to L(aa∗(ab+b))L(aa∗(ab+b)).
Construct an NFA for L(aba∗(b+ba))L(aba∗(b+ba)), and for L={w∈{a,b}∗:w contains exactly one pair of consecutive b′s}L={w∈{a,b}∗:w contains exactly one pair of consecutive b′s}.
Develop a regular expression representing strings of the form anbmanbmwhere n≥3n≥3and mmis odd, and another for anbmanbmwhere nnis odd and m≥3m≥3.