Answer: 4950
Explanation:
The number of possible combinations of n things taken r at a time is given by :-

Total nonnegative integers less than 100 ={0,1,2,... ,99} = 100
So, the number of combinations of choosing 2 out of them =

So, the number of ways to choose a set of two nonnegative integers less than 100 = 4950