many other Ben Rical sections. Consider the following concurrent program with 2 processes: Int x =0, y=0, z=0; Sem lock11, lock2=1; process A{ process B z=z+1; //a1 P(lock2); l/b1 P(lock1); //a2 y" y+2; //b2 x=x+1; //a3 P(lock1); 1/63 P(lock2); 1/84 xy+1; //b4 V(lock1); //a5 V(lock1); 1765 y= x+2; //a6 V(lock2); 1/b6 V(lock2); lla7 z=2+2;//b7 o (a.) This program might terminate, or it might end in a deadlock. What execution order leads to deadlock? o (b.) What are the possible values of x,y and z in the deadlock state? O (c.) What execution orders may lead to termination, and what are the final values of x, y and z if the program terminates? Show all possibilities. Consider the following