5. (15 MARKS) Give a high level description of an algorithm to show that Lnb = {(M) | M when started on the blank tape, eventually writes a nonblank symbol} is decidable. (HINT: If M has m states, how many moves will it take before you can tell?) 5. (15 MARKS) Give a high level description of an algorithm to show that Lnb = {(M) | M when started on the blank tape, eventually writes a nonblank symbol} is decidable. (HINT: If M has m states, how many moves will it take before you can tell?)