Let A be a set of n `(>=3)` distinct elements. The number of triplets `(x, y, z)` of the A elements in which at least two coordinates is equal to

Let A be a set of n(>=3) distance elements. The number of triplets (x,y,z) of the A elements in which at least two coordinates is equal to a.^(n)P_(3) b.n^(3)-^(n)P_(3) c.3n^(2)-2n d.3n^(2)-(n-1)

Let A be a set of n(geq3) distance elements. The number of triplets (x ,y ,z) of the A elements in which at least two coordinates is equal to a. ^n P_3 b. n^3-^n P_3 c. 3n^2-2n d. 3n^2-(n-1)

Let A be a set of n(geq3) distance elements. The number of triplets (x ,y ,z) of the A elements in which at least two coordinates is equal to a. ^n P_3 b. n^3-^n P_3 c. 3n^2-2n d. 3n^2-(n-1)

Let A be a set of n(ge 3) distinct elements. The number of triplets (x, y, z) of the elements of A in which ar least two coordinates are equal is

Let A be a finie set containing n distinct elements. The number of relations that can be defined on A is

Let A be a set containing ten elements. Then the number of subsets of A containing at least four elements is