| http://www.w3.org/ns/prov#value | - That means, we just need to select 1 more alphabet from the remaining 3 i.e. C, D and E. This can be done in 3 ways.So the total number of selections in which A and B are together = 3Therefore, of the total 10 selections, only 7 are such that A and B are not selected.So, the number of ways of selecting 3 alphabets such that A and B are not selected = 7 ways.Now, we are asked to arrange these 3 alp
|
