**L1= {⟨M⟩| M is a TM and |L(M)| = 5 }**

**|L(M)| = 5 = Language contain 5 strings.**

Question says

If M is Turing machine and it has 5 strings. Hence All Turing Machine has 5 strings . Suppose you are given a program now run that program with all Turing Machine as input now Tyes if all are stop and say they accept only 5 strings. Tno if all are stop and say length of Atleast one is not length 5 .

Now What happen when All Turing Machine are in loop . we get no output for many years. So its an undecidable problem.