Variable D is set to 100 in the beginning. The value of D will vary while P1,P2,P3 are being processed without synchronization. What could be the smallest and largest value of D that's possible as P1,P2, and P3 are processed? What would be the range of D value (largest D smallest D)? 1. This is the same problem as Zybook Chapter 6.12.1 Exercise. The pseudocode of the figure below illustrates an array-based stack's basic push() and pop() operations. Assuming that this algorithm could be used in a concurrent environment, answer the following questions: push(item) \{ if (top ERROR pop() \{ if (!is empty()) \{ top--; return stack[top]; else ERROR is empty() \{ if (top = 0 ) return true; else return false; \} a. What data have a race condition? b. How could the race condition be fixed? You can either describe the solution or provide the updated/fixed code