Give a regular expression for the following Language L, explain why this expression indeed describes L:

(n_a means number of a's)

L = {re {a,b}* prefix z of r the following holds: na(2) > n(2) > n.2) 2}