Question 20
For every positive integer $n,$ let $\operatorname{mod}_5(n)$ be the remainder obtained when $n$ is divided by $5.$ Define a function $f : \{0, 1, 2, 3, \ldots\}$ $\times \{0, 1, 2, 3, 4\}$ $\to \{0, 1, 2, 3, 4\}$ recursively as follows:
$$
\tiny f(i, j) = \begin{cases} \operatorname{mod}_5(j + 1) & \text{if } i = 0 \text{ and } 0 \le j \le 4, \\ f(i - 1, 1) & \text{if } i \ge 1 \text{ and } j = 0, \text{ and} \\ f(i - 1, f(i, j - 1)) & \text{if } i \ge 1 \text{ and } 1 \le j \le 4. \end{cases}
$$
What is $f(2015, 2)?$
$$
\tiny f(i, j) = \begin{cases} \operatorname{mod}_5(j + 1) & \text{if } i = 0 \text{ and } 0 \le j \le 4, \\ f(i - 1, 1) & \text{if } i \ge 1 \text{ and } j = 0, \text{ and} \\ f(i - 1, f(i, j - 1)) & \text{if } i \ge 1 \text{ and } 1 \le j \le 4. \end{cases}
$$
What is $f(2015, 2)?$