Question 17 Not yet answered Let p(x, y), be a Diophantine equation in two variables and integer coefficients. For example p(x, y) = x + x>y? - 4 is such equation. Define Z = {{p)|p(x, y) = 0 for some non-negative integer pairs (x, y)). For example the pair (2,0) is a root of p(x, y) = x + x^y3 - 4. Answer the following questions: 1. Explain a reasonable encoding for p(x, y) (i.e. (p): a string that specifies the polynomial and is used as input to a Turing machine) 2. Is Z recognizable? Answer Yes or No, and then provide a proof for your answer. Marked out of 5.00 Flag question You do not need to answer Part 1 in order to answer Part 2 or vice versa. They are independent. 7 A- B I $ ! O U S X2 x2