Consider the following $C$ code segment:
A[i] = A[i] + 1; // Line 1
j = i + 1; // Line 2
A[j] = A[i] * 2; // Line 3
k = i; // Line 4
A[k] = A[k] + 1; // Line 5
In the context of data-flow analysis for code optimization, we are interested in Write-After-Read (WAR) dependencies.
Ignoring all loops and function calls, the number of distinct Write-After-Read (WAR) data dependencies in this code segment is $\_\_\_\_$