Prove that the following languages are regular:

1. L1={|,{a,b}||=3}

2. L2 = {ab4b2 | {a,b}}

3. L3={ambn |m,n0}

Note that in these problems the absolute value operator is overloaded to also denote the length of a string.