Q$4$ Simplifying regular expressions

$16$ Points

Grading comment:

A regular expression is said to be simplersimpler than another if it involves less operations than the other. For example, aa $(0$ operation$)$ is simpler than $($a$)($a$)(2$ operations$)$ and $($a$$b$)$c$($a$$b$)$c $(2$ operations$)$ is simpler than ac$$bcac$$bc $(3$ operations$).$ Rewrite each of the following regular expressions as a simpler regular expression describing the same language. $($For full credit simplify as much as possible$).$ Show your work.

Question $4\mathrm{.}1$

Q$4\mathrm{.}1$

$1$ Point

Grading comment:

$$a$$a$$b$$a$$a$$b$$