I'm assuming it's a Markov Chain question but I have no idea how to do this. Thanks in advance!
A mouse lives in a mousehole with three exits.
- The first exit leads to a compost heap after 1 minute of scurrying.
- The second exit leads to a tunnel that returns it to the mousehole after three minutes.
- The third exit leads to a tunnel that returns it to the mousehole after four minutes.
Assume the mouse has no memory of previous excursions when it returns to its mousehole, and is always equally likely to choose any one of the exits, what is the expected length of time until the mouse reaches the compost heap?