A chocolate bar consists of 100 squares in a single row. To break it into pieces, we number the squares from left to right from 1 to 100 and then use a random process, as follows. For every i 1,... ,100, we pick a random number X, from 1 to 100 and look for the square Xi. If the square is still on the bar, we break the bar into two pieces at that right boundary of that square, and remove the piece on the left. (Note that, if X,-100, then we are essentially . If the square is not there (because it is in a piece that has already been removed), then we Note that the number of pieces created by this process can be anywhere from 1 (if X 100) to 100 removing the whole of the remaining chocolate.) just remove the leftmost square that is still there. (if every Xi equals i). Which of these possible values has the highest probability? A chocolate bar consists of 100 squares in a single row. To break it into pieces, we number the squares from left to right from 1 to 100 and then use a random process, as follows. For every i 1,... ,100, we pick a random number X, from 1 to 100 and look for the square Xi. If the square is still on the bar, we break the bar into two pieces at that right boundary of that square, and remove the piece on the left. (Note that, if X,-100, then we are essentially . If the square is not there (because it is in a piece that has already been removed), then we Note that the number of pieces created by this process can be anywhere from 1 (if X 100) to 100 removing the whole of the remaining chocolate.) just remove the leftmost square that is still there. (if every Xi equals i). Which of these possible values has the highest probability