The correct options are
A 2nCn
B 21⋅62⋅103⋅⋯4n−6n−1⋅4n−2n
C n+11⋅n+22⋅n+33⋅n+44⋅⋯2n−1n−1⋅2nn
D 2n[1⋅3⋅5⋯(2n−3)(2n−1)]n!
Let the number of a′s be x.
Then, number of b′s is 2n−x
As a′s and b′s are alike, number of permutations =(2n)!x! (2n−x)!=2nCx
Now, we know that, if n is even, nCr is maximum for r=n2
∴2nCx is maximum when r=2n2=n
Hence, maximum number of permutations =2nCn
2nCn=(2n)!n! n!
=2n⋅(2n−1)⋅(2n−2)⋯(n+1)⋅n!n! n!
=2n⋅(2n−1)⋅(2n−2)⋯(n+1)n!
=(n+1)⋅(n+2)⋅(n+3)⋯(2n−1)⋅(2n)1⋅2⋅3⋯(n−1)⋅n
2nCn=2n!n!n!
=1⋅2⋅3⋯(2n−1)⋅(2n)n!n!
=(1⋅3⋅5⋯(2n−1))(2⋅4⋅6⋯2n)n!n!
=1⋅3⋅5⋯(2n−1)2n(1⋅2⋅3⋯n)n!n!
=2n(1⋅3⋅5⋯(2n−3)(2n−1)n!
=2⋅6⋅10⋯(4n−2)1⋅2⋅3⋯(n)
(multiplying whole numerator by 2n)
=21⋅62⋅103⋅⋯4n−6n−1⋅4n−2n