Please solve it in 30 minute i will upvote you

Let L be the language of all equations QoXd + Qxd-1 +...+ad-1X + ad = 0, with unknown X and integer coefficients ao, a1,...,4d-1,4d, which have a solution in the integers. (i) Show that L is semi-decidable by describing, in general mathematical terms, an algorithm that takes an equation 20xd +ajxd-1 +...+2d-1X + ad = 0 with 20, 22,..., Ad-1,20 Z as input and halts exactly when this equation has a solution in the integers. (ii) Using the fact that L is actually decidable, describe an algorithm which for any equation 20xd +QjXd-1 +...+0d-1X + ad = 0 with ao, 22, ...,Ad-1, Qd Z, decides whether or not it has integer solutions, and if it does, finds at least one such solution