There are `n` urns numbered `1` to `n`.

There are n urns each containing (n+1) balls such that ith urn contains i white balls and (n+1-i) red balls.

There are n urns each containing (n+1) balls such that the i^(th) urn contains ' I' white balls and (n+1-i) red balls. Let U_(i) be the event of selecting i^(th) urn, i=1,2,3,.., n and W denotes the event of getting a white ball. If P(U_(i)) prop i, where i=1,2,3,..,n, then lim_(n to oo) P(W) is equal to

There are n urns each containing (n + 1) balls such that the i^(th) urn contains i white balls and (n + 1 - i) red balls. Let u_i be the event of selecting i^(th) urn, i = 1,2,3,.... , n and w denotes the event of getting a white balls. If P(u_i) = c where c is a constant, then P(u_n/w ) is equal

There are n urns each containing (n+1) balls such that ith urn contains i white balls and (n+1-i) red balls. Let u_i be the event of selecting ith urn, i=1,2,3…, n and w denotes the event of getting a white ball. IfP(u_i)=c, where c is a constant then P(u_n/w) is equal to

There are n urns each containing (n+1) balls such that ith urn contains i white balls and (n+1-i) red balls. Let u_i be the event of selecting ith urn, i=1,2,3…, n and w denotes the event of getting a white ball. IfP(u_i)=c, where c is a constant then P(u_n/w) is equal to

There are n urns each containing (n+1) balls such that ith urn contains i white balls and (n+1-i) red balls. Let u_i be the event of selecting ith urn, i=1,2,3…, n and w denotes the event of getting a white ball. IfP(u_i)=c, where c is a constant then P(u_n/w) is equal to

There are n urns each containing (n+1) balls such that ith urn contains 'I' white balls and (n+1-i) red balls. Let u1 be the event of selecting ith urn, i=1,2,3…, n and w denotes the event of getting a white ball.If P(ui)=c, where c is a constant then P(un/w) is equal to

In n is an even number, then the largest natural number by which n(n+1)(n+2) is divisible is