A and B represent some arbitrary computations in the functions f1 and f2. An unbounded number of processes are invoking either of the two functions

1. How many invocations of the computation A can proceed concurrently and what are the values of s1, c1, and d?

2. While A is running, how many invocations of B can proceed concurrently and what are the values of s2, c2, and d?

3. Can A or B starve? Why or why not??

f10: P(51) cl = cl + 1 if (cl == 1) P(d) V(sl) f20: P (52) c2 = c2 + 1 if (c2 == 1) P(d) V(52) P(51) cl = cl - 1 if (cl == 0) V(d) v (51) P (52) c2 = c2 - 1 if (c2 == 0) V(d) V(52) Initially, s1 = s2 = d = 1; C1 = c2 = 0