Answer: B
Explanation:
i := 0; j := 0; k := 0;
for (m := start; m <= end; m := m+1){
k := k + m; // "k" will have the accumulated sum from start to end.
if (prime(m)){
i := i + m; //prime values are added to "m".
}else{
j := j + m; //Values which are NOT prime are added to "j".
}
}
Here,
$\large \color {red}{{\mathrm {\large k}}}$ will contain the sum of all the values from start to end.
$\color {red} {\mathrm {\large i}}$ will contain the sum of values which are prime.
$\color {red} {\mathrm {\large j}}$ will contain the sum of values which are NOT prime.
Hence, finally the values in k is the sum of values in i and j.
$\therefore$ The relation is: $\color {blue}{\mathrm {\large k = i + j} }$
Hence, B is the right option.