I'm sorry but nobody can help you unless you ask a question, this is a statement.
here is problem statment :
N large empty boxes (assume they are of type:1) are initially placed on a table. An unknown number of boxes (type:1) are selected and in each of them K smaller boxes (type:2) are placed. Again an unknown number of type:2 boxes are selected and K boxes of type:3 are placed inside. This process is repeated T times. Now a box is assumed to be empty when it has no smaller boxes inside it. Finally after all the processes are complete let there be F empty boxes in total.
N:11 - K:8 - T:2 - F:102
can any one help me how can i solve it