Expected Value, Linearity & Advanced Probability · Superchallenge problem

A binary string of length $10$ is generated by $10$ independent fair coin flips. Find the expected number of maximal runs (maximal blocks of equal symbols).

The answer is a fraction $\tfrac{m}{n}$ in lowest terms; find $m + n$.