To build the coding scheme of a cyclic code that calculates the division of the polynomial $1+$ x$^4+$ x$^5$

with its derived polynomial g$($x$)=1+$ x$^2.$ Verify the operation of this scheme if as input we have the message $110001.$ Does the division of these polynomials give the same check bits as the coding scheme?