Consider the mutex algorithm of Ricart and Agrawala. Recall the assumptions:

1. Each thread executes at non-zero speed. 2. Communication lines and input ports are non-FIFO (non here means not necessarily). 3. Each thread can receive its input messages independently, without synchronization issues with other threads inputs.

In each question, a modification to the code is suggested. Will the new code work? (YES or No). If Yes, give an explanation, in less than 50 words. If No, give a counter example. In this example, assume we have EXACTLY TWO processes P0 and P1 in the system.

Q1. In the thread receiving Request messages, the assignment to Defer_it it replaced by: Defer_it := (Requesting_Critical_Section AND j>me)