True or False

Answer all please Thank you <3

1.A maximum of 2 threads can process the writelock of a readwritelock at the same time.

2. When the threads in the program are not making progress, you can determine if it is due to a deadlock or a livelock by using the resource monitor to investigate the programs memory usage to see if it continues to grow.

3.There is no limit on the number of threads that can possess the readlock while another thread has a lock on the writelock.

4. The best use case for using a ReadWriteLock is when lots of threads need to read the value of a shared variable, but only a few thread need to modify its

value.

5.Two threads that are both reading the same shared variable has no potential for data race.

6. The best case for using a ReadWriteock is when lots of threads need to modify the value of a shared variable.

7. To lock a mutex multiple times, using reentrant mutex may seem like an easy way to avoid a deadlock.

8.Protecting a critical section of code with mutual exclusion means that whenever a thread enters the critical section, it pauses all other threads in the program.

9. Deadlock occurs when each member of a group is waiting for some other member to take action, and a result, neither members is able to make progress.

10. Try lock or try enter is a blocking version of the lock or acquire method.

11.To avoid livelock, ensure that only one process takes action chosen by priority or some other mechanism, like random selection.

12. Starvation occurs when a thread is unable to gain access to a necessary resource, and is therefore unable to make progress.

13. Data races can be hard to identify because the problems that data races case have an insignificant impact on the programs performance.