can anyone help me to Write regular expression and draw FA in theory of automata

Question

Consider the language, defined over Σ={m, n} of words starting with a and ending in b OR starting with b and ending in a but the length is odd, then write a regular expressi