Semi decidability and complexity

(a) Let n > 0 be an integer and Ln be the language of all linear equations a1X1 + a2X2 + · · · + anXn + an+1 = 0 in n unknowns X1, X2, . . . , Xn and over integer coefficients a1, a2, . . . , an, an+1, which have a solution in the integers. (i) Show that Ln is...