Given the definition of language L below, do each of the following: (1) state whether or not L REG and prove it, and (2) state whether or not L CFL and prove it.

Let L={0ⁱ1^j0^k | i,j,k0 and (I=2j or j=k)}.