What is the language described by the following regular expression:

$($a$+$b$)*$b$($a$+$b$)*$

The set of all strings of length at least $3$

The set of all strings with a b in the middle

The set of all strings with more b$\text{'}$s than a$\text{'}$s

The set of all strings with at least one b