First part:
Let $a,b,c$ represent $3$ consecutive days. Since we are in state $1$, that means we have the sequence $(a,b) = \text{(no rain, rain)}$. In order to jump onto state $0$, there must hold $(b,c) = \text{(rain, rain)}$. Then we have the sequence $(a,b,c) = \text{(no rain, rain, rain)}$. According to the assumptions, starting from $(a,b)$ we can reach $c$ with probability $p=0.5$.
Also, $P_{11} = 0$. Why? If we still have $3$ consecutive days $a,b,c$ then it must hold $(a,b) = \text{(no rain, rain)}$ and $(b,c) = \text{(no rain, rain)}$, which can't happen.
Second part:
Notice that we start from state $0$, thus $\pi(0) = \begin{bmatrix} 1& 0 & 0 & 0\end{bmatrix}$ and we are going to evaluate the probability:
$$\pi(0)\cdot P^2 = \begin{bmatrix} 0.49 & 0.12 & 0.21 & 0.18\end{bmatrix}. $$
Thus, the probability that it rains on Thursday is going to be $p=0.49+ 0.12 = 0.61$ (see part $3$).
Third part:
From part $2$ it is known that the initial state is the state $1$. Assuming that we have the sequence $(a,b,c,d)$ with $a$ corresponding to the first day (Monday) and $d$ correspond to the last day (Thursday). Thus, we want the following to hold:
$$(a,b,c,d) = \text{(rain, rain, x, rain)}.$$ $x$ could either represent a rainy day or a non - rainy day. Thus, the are $2$ paths.
1: $(a,b,c,d) = \text{(rain, rain, rain, rain)}$
2: $(a,b,c,d) = \text{(rain, rain, no rain, rain)}$
Τhus, $(c,d)$ is going to be either (rain, rain), which indeed corresponds to state $0$ or (no rain, rain), which corresponds to state $1$.
Speaking with term of states the first $4-tuple$ corresponds to the path $0\to 0\to 0$, thus we have $p_{00}\cdot p_{00}= 0.7^2=0.49$ and the second $4-tuple$ corresponds to the path $0\to 2\to 1$, thus $p_{02}\cdot p_{21} = 0.3 \cdot 0.4 = 0.12$. Adding the two probabilities, leads us to the answer of the second part.
Best Answer
You can't find "the steps it takes" because that's a random quantity. But you can find the expected number of steps it takes, starting in a given state. In your example, let $u_1$ and $u_2$ be the expected number of steps until reaching the absorbing state, starting in states $1$ and $2$ respectively.
Suppose, for example, you start in state $1$.
The first column of the matrix says that after the first step, with probability $0.3$ you stay in state $1$ (and then the expected number of additional steps until reaching the absorbing state is again $u_1$); with probability $0.6$ you are in state $2$ (and then the expected number of additional steps is $u_2$), and with probability $0.1$ you are in the absorbing state $3$ so no additional steps are needed. This says $u_1 = 1 + 0.3 u_1 + 0.6 u_2$. Do a similar analysis for starting in state $2$, getting another equation, and solve the system of two equations for $u_1$ and $u_2$.