Two concurrent processes share a data item sum, which is initialized to $0.$However, they do not use mutual exclusion while accessing its value, which means that we have a race condition here. Each

process contains a loop that executes $50$ times and contains the single statement sum $=$sum$+1($notice that this statement means three machine instructions. One: to read value of variable sum from memory, two: andd $1$ to that value, three: store the result back into memory$).$ If no other operations are performed on sum, indicate the lower bound and upper bound on the value of sum when both processes terminate.Two concurrent processes share a data item sum, which is initialized to $0.$However, they do not use mutual exclusion while accessing its value, which means that we have a race condition here. Each

process contains a loop that executes $50$ times and contains the single statement sum $=$sum$+1($notice that this statement means three machine instructions. One: to read value of variable sum from memory, two: andd $1$ to that value, three: store the result back into memory$).$ If no other operations are performed on sum, indicate the lower bound and upper bound on the value of sum when both processes terminate.