By the binomial theorem, the coefficient is S=∑k=48100kC(k, 48), since powers below 48 cannot contribute.
Pascal’s identity gives C(k, 48)=C(k+1, 49)−C(k, 49). Hence S=∑k=48100kC(k+1, 49)− ∑k=48100kC(k, 49).
In the first sum put j=k+1. Its terms are (j−1)C(j, 49), for 49≤j≤101. The second sum starts effectively at j=49 because C(48, 49)=0. Subtracting the overlapping terms leaves S=100C(101, 49)− ∑j=49100C(j, 49).
The hockey-stick identity gives ∑j=49100C(j, 49)=C(101, 50). Thus the desired coefficient is 100⋅ 101C49 − 101C50, which is option (1).