In this language ultimately we are accepting all the strings in which a^mb^n.. There are 2 constraints which are given to us :
First constraint is that m=m and 2nd m is not equal to n So for any values of m and n either of the given constraints would be followed. Hence it is a regular language.