Please solve it in 20 minute i will upvote you

Let L be the language of all equations 20xd + Qxd-1 + ... +0d-1X + Qd = 0, with unknown X and integer coefficients do, ai,...,4d-1,2d, 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 qoxd+aXd-1 + ... +0d-1X +Qd = 0 with 20, 22, ..., Ad-1,Qd Z as input and halts exactly when this equation has a solution in the integers. [5] (ii) Using the fact that L is actually decidable, describe an algorithm which for any equation QoXd +Q2.X-1 + ... +04-1X +Qd = 0 with an, 22, ..., 9d-1, ad Z, decides whether or not it has integer solutions, and if it does, finds at least one such solution. (5) Let L be the language of all equations 20xd + Qxd-1 + ... +0d-1X + Qd = 0, with unknown X and integer coefficients do, ai,...,4d-1,2d, 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 qoxd+aXd-1 + ... +0d-1X +Qd = 0 with 20, 22, ..., Ad-1,Qd Z as input and halts exactly when this equation has a solution in the integers. [5] (ii) Using the fact that L is actually decidable, describe an algorithm which for any equation QoXd +Q2.X-1 + ... +04-1X +Qd = 0 with an, 22, ..., 9d-1, ad Z, decides whether or not it has integer solutions, and if it does, finds at least one such solution