In lecture, we proved that Kolmogorov complexity is uncomputable. In other words, there is no Turing machine that, on input s, halts with K(s) written on its tape. In this problem, you will work with another uncomputable function called the \generalized busy beaver function."

a. The generalized busy beaver function B(n) is defined as the largest number of steps that an n-state Turing machine can run before eventually halting when ε is used as input. Show that if B(n) is computable, then we can decide Lę-HALT:
b. Conclude that B(n) is uncomputable.