How many ways are there to put 2 balls in boxes (where ) if (c) the balls are not distinguishable but the boxes are? My approach was to notice the two cases of how the balls can be placed. 20 and 11. For 20, I figured that there are n ways to place the 2 balls (n*1} = n. For 11, lthought that there are n[n-1) ways to place the balls. n+n(n-1) : n+n"2 - n : n"2 Why is this solution wrong