From the set {a,b,c,d,e,f} find no. of arrangements for 3 alphabets with no data repeated.
Answers
Answered by
0
The solution is attached
Attachments:
Similar questions