Question 28
A sequence of throws of a die is called *nondecreasing* if the result of each successive throw is at least as large as the previous one in the sequence. For instance, one example of a nondecreasing sequence of 10 throws is
$1, 2, 2, 2, 2, 4, 4, 4, 4, 4, 5$.
Compute the total number of nondecreasing sequences of 10 throws.
$1, 2, 2, 2, 2, 4, 4, 4, 4, 4, 5$.
Compute the total number of nondecreasing sequences of 10 throws.