Alice and bob play the following game: they start with an empty 2008x2008 matrix (p. s. take a wild guess which year this was) and take turns writing numbers in each of the 20082 positions. once the matrix is filled, alice wins if the determinant is nonzero and bob wins if the determinant is zero. if alice goes first, does either player have a winning strategy?

Bob wins

Step-by-step explanation:

Think first in a simpler case. In a 2x2 matrix the determinant is zero if two columns or rows are proportional. So Alice writes the first number, then Bob write the same number in the same column but in the other row. Bob repeat the procedure after Alice's second number, and win.

If the matrix is nxn where n is even (like 2008) Bob will win following the previous procedure. Alice writes a number anywhere, Bob writes the same number in the same column in the above (or below) row.  Every time Alice write a number in the same row as her first one, Bob copy that number in the above (or below) row. Any other rows are not important, i.e, the determinant will be zero with any values in them.    

step-by-step explanation:

descending order means to order the polynomials from the term with the largest exponent to the term with the smallest exponent.  

therefore, the correct answer is d.