Show a regular expression that denotes the language of all strings based on alphabet $\backslash$Sigma $=\{$ a$,$ b $\}$ that start with a$,$ end with a and whose total number of a$\text{'}$s is odd. Explain your answer.