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. (Hint: carefully determine which strings are contained within the intersection.) Let L={0ⁱ1^j0ⁱ | i,j0}(00)(11)