Exercise 4.2.3: Controlling concurrent executions. 0 About 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. f10 f20: P(52) c2 = c2 + 1 if (c == 1) P(d) V(52) P(51) c1 = C1 + 1 if (cl == 1) P(d) V(51) A P(51) c1 = c1 - 1 if (c1 == 0) V(d) v(sl) P(S2) c2 = c2 - 1 if (c == 0) V(d) V(S2) Initially, s1 = s2 = d = 1; c1 = c2 = 0. How many invocations of the computation A can proceed concurrently and what are the values of s1, c1, and d? (b) While A is running, how many invocations of B can proceed concurrently and what are the values of s2, c2, and d? Can A or B starve? Why or why not?? Feedback