I need assistance on this problem about Turing machines, if it is possible with some remarks on the theory behind the exercise. In class, we discussed how it is possible to enumerate Turing machines. Let's denote the i-th Turing machine by M; and define a function f(.) as follows: If M; halts with an empty input, then f(i) = the number of steps taken before halting. Otherwise, f(i)=0. Furthermore, let's consider Prove that g() is not computable. g(j) := max f (i) isj