Question 1209828
Let's calculate $L_4$ using the given recurrence relation and initial values.

* $L_0 = 2$
* $L_1 = 1$
* $L_n = L_{n-1} + L_{n-2}$ for $n \ge 2$

Now, let's find the subsequent terms:

* $L_2 = L_1 + L_0 = 1 + 2 = 3$
* $L_3 = L_2 + L_1 = 3 + 1 = 4$
* $L_4 = L_3 + L_2 = 4 + 3 = 7$

Therefore, $L_4 = 7$.

Final Answer: The final answer is $\boxed{7}$