Option B
s in the above question is nothing but the sum of degrees of a graph with Δ(maximum degree) <=100 and δ(minimum degree)>=1.
We know that no of edges in a tree with V nodes is V-1 , here 100-1 =99 edges
By Handshaking lemma , sum of degrees (s)= 2*no of edges=198