Which of the following languages are regular. Prove (by providing a regular expression) or disprove.

a. L1 = {aⁱ b^j | j = i² and i, j 2}

b. L2 = {x | x {0, 1} and x = 2^m expressed in binary for m 1 }

c. L3 = {aⁿ b^m | m 2n, n, m 1}