5 Problem 5 n are Suppose that we take ten coins and arrange them so that n are showing heads and 10. showing tails (where 0 n 10). How many ways are to order these coins (without flipping them over) so that there are at least two heads in a row? (For example, if n = 3 then TTTHHTTHTT would count, but THTTHTHTTT would not.) Assume that the only way to distinguish coins is by their face, so that any two heads are identical and any two tails are identical.