If the last time Bob cleaned up his room was $k$ days ago, then he cleans it up today with probability $1/(k + 1)$. But if the last time he cleaned up was 4 days ago, his father cleans it up. How often is the room cleaned on average?
I'm not really sure what to do for this question and have been stuck for a while. Would anyone be able to help out?
The first step is plainly to figure out what the states are. We have $C_k$ for $k=1,2,3$ meaning that the room was last cleaned $k$ days ago. We also have two absorbing states, $B$ and $F$, meaning that Bob or his father cleans the room, respectively. We know that the initial state is $C_1$.
If the chain is in state $C_k,\ k=1,2$ then it moves to state $B$ with probability $1/(k+1)$ and to state $C_{i+1}$ with probability $k/(k+1)$. If it is in state $C_3$ then it moves to state $F$ with probability $3/4$.
Now you can find the probability of states $B$ and $F$ by analyzing the absorbing Markov chain. But this is overkill. No state is ever re-visited, so you can just draw a tree diagram.