Consider the following two functions, where A and B are arbitrary computations: f1(){P(s1);c1 = c1+1;if(c1==1)P(d);V(s1);A();P(s1); c1 = c1-1;if (c1 ==0) V(d);V(s1);}

f2(){P(s2);c2 = c2+1;if(c2==1)P(d);V(s2);B();P(s2); c2 = c2-1;if (c2 ==0)V(d);V(s2);}

Initially, s1=s2=d=1; c1=c2=0;

Assume that an unbounded number of processes are invoking either of the functions f1() aor f2().

How many invocations of the computation A() can proceed concurrently? What are the values of s1, c1, and d at that time?

Which of these options are the correct sequence of actions for content to be copied and pasted? select content, click the copy button, click the paste button, and move the insertion point to where the content needs to be inserted. click the copy button, select the content, move the insertion point to where the content needs to be inserted, and click the paste button. select the content, click the copy button, move the insertion point to where the content needs to be inserted, and click the paste button. select the content, move the insertion point to where the content needs to be inserted, click the copy button, and click the paste button.