How to solve this problem? especially have no idea about part b

Problem 1. 7 . Consider homogeneous polynomials f( . .... In ) of degree n whose coefficients are O or 1 . ( a ) Show that such polynomials can be encoded as a binary string* ( b ) Describe informally a non - deterministic Turing machine that recognizes the language A consisting of polynomials f (*1 . .... In ) of degree ~ which have a zero ( that is , there exists ( a1 . .... an ) { |0, 1}' with f (al . .... an ) = 0 ). As with the previous problem , you should provide some but not all of the details