Markov Chains & Long-Run Behavior · Challenge problem

A process moves A → B → C, where from each of A and B a step succeeds (advances) with probability $\tfrac12$ and otherwise stays put; C is absorbing. Compute the expected number of steps to reach C from A.