1. We have n distinct objects, some of which we are distributing among Alice, Bob, and Charlie. Out of these n objects, we give a objects to Alice, b objects to Bob, and c objects to Charlie. Give n,a,b, and c such that the number of ways we can do this is equal to (169)(93)(61). Show your calculations and justify your answer. (Hint: Systematic methods exist. Brute-force methods can be resorted to by expanding the expression.) n=a=.b=c=.