PLS follow the requirement and do not copy from others

#include #include #include

int count; int turn = 0; // Shared variable used to implement strict alternation pthread_mutex_t the_mutex;

void* myFunction(void* arg) { int actual_arg = *((int*) arg); for(unsigned int i = 0; i

// Random wait - This code is just to ensure that the threads // show data sharing problems int max = rand() % 100000; for (int x = 0; x

// HINT: It is not necessary to make any changes in main() int main() { int rc[2]; pthread_t ids[2]; int args[2]; count = 0; for(unsigned int i = 0; i

Part 3: Strict Alternation (10 points) 1. A file named pthread-data-sharing-mutex-strict-alternation.cpp has been provided to you in the same project. 2. Compile the program and make sure that it executes. 3. Examine the program code. Note that except for some minor changes, this program is identical to the one you used in Part 2 of this assignment. 4. Modify the program to implement the strict alternation solution to achieve mutual exclusion (refer back to the relevant prep work video/slides if you need to; IMPORTANT NOTE: the outer, infinite while loop in the prep work video/slides is just an example and is not part of the strict alternation solution; only the empty while loop before the call to the critical region and the line immediately following the call to the critical region are part of the strict alternation solution). 5. Build and execute the updated program several times. Expected Output: Your program should produce the following output (Note: it does not matter whether Thread #0 goes first or Thread #1, but it is important that the threads strictly alternate)