Consider three threads, concurrently executing the three programs shown here. The variables x, y, and z are integers with initial value 0.

a. Can executing these three threads concurrently produce a deadlock? (If yes, give an example; if not, argue why not.)

b. Does your answer change if the order of the release operations in each thread is reversed? (If they can deadlock, give an example; if not, argue why not.)

Thread 1: for from 1 to 100 do ACQUIRE (A) ACQUIRE (B) XXX + 1 Thread 2: for from 1 to 100 do ACQUIRE (B) Thread 3: for from 1 to 100 do ACQUIRE (A) ACQUIRE (C) Z