Yes, of course, 0 nullity is wrong. A linear transformation has trivial kernel if and only if it is invertible. And differentiation is not invertible.
I am assuming that P3 means the vector space of polynomials of degree 3 or less, which has dimension 4. Some texts use P3 to mean the 3 dimensional vector space of polynomials of degree 2 or less. If that is the case, the same argument works and is simpler.
The kernel consists of all vector in P3, that is all polynomials of the form [itex]p(x)= a+ bx+ cx^2+ dx^3[/itex], such that [itex]T(p)= (1- x^2)p''- 2xp'=[/itex][itex](1- x^2)(2c+ 3dx)- 2x(b+ 2cx+ 3dx^2)=[/itex][itex]2c+ 3dx- 2cx^2- 3dx^3- 2bx- 4cx^2- 6dx^3[/itex][itex]= -9dx^3- 6cx^2+ (3d- 2b)x+ 2c= 0[/itex], for all x. That means we must have -9d= 0 so d= 0, -6c= 0 so c= 0, 3d- 2b= -2b= 0 so b= 0, but there is NO condition on a. Any polynomial of the form [itex]tex= a+ 0x+ 0x^2+ 0x^3= a[/itex] is in the kernel of T. The nullity is 1 and a basis for the kernel is the single constant polynomial {1}.
Since the nullity has dimension 1 and P3 has dimension 4, the range must have dimension 4- 1= 3.
Again, writing [itex]p(x)= a+ bx+ cx^2+ dx^3[/itex] we have, as before, [itex]T(p)= -9dx^3- 6cx^2+ (3d- 2b)x+ 2c[/itex]. If we write that as [itex]-9dx^3- 6cx^2+ (3d- 2b)x+ 2c= i+ jx+ kx^2+ lx^3[/itex] then we have -9d= l, -6c= k, 3d- 2b= j, and 2c= i.
From -6c= k we have c= -k/6. Then 2c= i becomes 2(-k/6)= -k/3= i so k= -3i. That is the one condition on i, j, k, and l we have: we can write any vector in the range as [itex]i+ jx+ (-3i)x^2+ lx^3= (1- 3x^2)i+ jx+ lx^3[/itex]. [itex]\{1- 3x^2, x, x^3\}[/itex] is a basis.