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.

Define bin(s) as a function which takes a string s {0, 1}^ and returns its numeric value when s is interpreted as a binary number (with the most significant bit on the left).

Let L = {b {0,1}^ | bin(b) is not a multiple of 4}. ***Last time when I posted this question, Someone gave me a flawed answer. So, please if you are not sure don't attempt.