Turing Machine Decidability Question:

Consider the following two languages:

L1 = {M | M accepts at most 13 distinct inputs }

L2 = {M | M accepts more than 13 distinct inputs }

1. Are these languages decidable?

2. Are these languages recognizable?

Prove all your answers.