1. For a Turing machine M, (M) denotes an encoding of M. Consider the following two languages. L1 = {(M) | M takes more than 2021 steps on all inputs} L2 = {(M) | M takes more than 2021 steps on some input} Which one of the following options is correct? 1. Both L1 and L2 are decidable 2. L1 is decidable and L2 is undecidable 3. L1 is undecidable and L2 is decidable 4. Both L1 and L2 are undecidable