3. Consider the following languages. L1 = {M | M takes at least 2016 steps on some input} L2= {M | M takes at least 2016 steps on all inputs g} L3= {M | M accepts } Where for each Turing machine M, M denotes a specific encoding of M. Which one of the following is TRUE? 1. L1 is recursive and L2,L3 are not recursive 2. L2 is recursive and L1,L3 are not recursive 3. L1,L2 are recursive and L3 is not recursive 4. L1,L2,L3 are recursive