I hope it is no surprise that your book is correct. Basically the problem is this: you have a linear transformation from 2 by 2 matrices to 2 by two matrices defined by :
[tex]\left[\begin{array}{cc} a & b \\ c & d \end{array}\right][/tex] mapped to [tex]\left[\begin{array}{cc} 0 & c \\ 0 & d \end{array}\right][/tex]
Yes, since a and b "disappear" they play no part in determining the kernel. The only non-zero terms in the resultant matrix are c and d. It they are 0, then the result is the zero matrix. What that means, then, is that a and b can be anything at all as long as c= 0 and d= 0. Taking a= 1, b= 0 gives the matrix
[tex]\left[\begin{array}{cc} 1 & 0 \\ 0 & 0 \end{array}\right][/tex]
and taking a= 0, b= 1 gives the matrix
[tex]\left[\begin{array}{cc} 0 & 1 \\ 0 & 0 \end{array}\right][/tex]
Those two matrices form a basis for the kernel.
I don't think it really makes sense to talk about "a and b don't matter in determining the Image". a and b are only in the matrix the transformation is applied to- not in the resultant matrix. Obviously, every matrix in the image have first column 0. The second column can be anything. A basis for the image is
[tex]\left[\begin{array}{cc} 0 & 1 \\ 0 & 1 \end{array}\right][/tex]
and
[tex]\left[\begin{array}{cc} 0 & 0 \\ 0 & 1 \end{array}\right][/tex]
In your "totally logical" solution, you are applying a matrix to the 0 vector. The "kernel" of a transformation is the set of vectors that are mapped to the 0 vector, not that the 0 vector is mapped to. You are going the wrong way.
(Any linear transformation maps the 0 vector to the 0 vector.)