3) A race condition A) results when several threads try to B) access the same data concurrently results when several threads try to access and modify the same data concurrently C) will result only if the outcome of execution does not depend on the order in which D) None of the above 4) A counting semaphore A) is essentially an integer variable B) is accessed through only one standard operation C) can be modified simultaneously by multiple threads D) cannot be used to control access to a thread's critical sections 5) A mutex lock A ) is exactly like a counting semaphore B) is essentially a boolean variable C) is not guaranteed to be atomic D) can be used to eliminate busy waiting 6) A solution to the critical section problem does NOT have to satisfy which of the following requirements? A) mutual exclusion B) progress C) atomicity D) bounded waiting can be used to prevent busy waiting when implementing a semaphore. A) semaphore B) Waiting queues C) Mutex lock D) pthread join