# Permutation-Combination

**Discrete Mathematics**Level pending

The number of ways of arranging nn students in a row such that no two boys sit together and no two girls sit together is m(m>100)m(m>100).

If one more student is added, then number of ways of arranging as above increases by 200%, The value of n is:

A. 1212

B. 88

C. 99

D. 10