Consider the following C-like pseudocode program:

const int n = 50;

int total; // shared variable

void sum()

{

for (int count = 1; count <= n; count++)

{

total++;

}

}

void main()

{

total = 0;

// create two concurrent instances of procedure sum

parbegin(sum(), sum());

write (total);

}

Note: The pseudocode statement parbegin creates concurrent processes that run the procedure code indicated by the arguments of parbegin.

a)Determine the actual lower bound and upper bound on the final value of the shared variable total output by this concurrent program. Assume that the two processes created by parbegin can execute at any relative speed, and that a value can only be incremented after it has been loaded into a register by a separate machine instruction.

b)Suppose that an arbitrary number N of these processes are permitted to execute concurrently under the assumptions of part (a). What effect will this modification have on the range of final values of total?