Assume we have two threads each running its own code but sharing a variable counter from their parent shared data. Also, assume a uniprocessor system is used. Counter=0

//Thread 1 //Thread 2
for (i=0; i< 10; i++)
{
counter = counter +1;
}
for (j=0; j < 10, J++)
{
counter = counter + 1;
}

1. Prove that there is a race condition in the above example. (10 marks)
2. What is the possible maximum value of variable counter when both threads terminate normally? Show how you calculated that value. (4 marks)
3. Solve the race condition problem above by modifying the code using the Test-and-Set instruction. (6 marks)