Write a regular expression for the language consisting of strings that have n copies of the letter a followed by the same number of copies of the letter b where n $>0.$For example strings ab$,$ aabb, aaaabbbb, are in the language but a abb, ba$,$ aaabb are not.