PROBLEM 15. Cooperating Processes. Consider the following example (3-page hands-on is given in the class) using classical fork join and quit. Example Slide 219 ProcA procB while (TRUE) while (TRUE) ; update(x); FORK(L2); retrieve(x); update(y) FORK(L3) 1: 101N(count); retrieve(y); goto LO; L2: , goto L1; L3: goto LO; Consider also that section A1 is executed in 4 time units, section A2 - 6 time unites, section B1 -3 time units, section B2-5 time units. All other operations occupy 1 time unit. Trace the execution of the code showing the creation of the processes (basic threads) during the elapsed time (12 points) PROBLEM 15. Cooperating Processes. Consider the following example (3-page hands-on is given in the class) using classical fork join and quit. Example Slide 219 ProcA procB while (TRUE) while (TRUE) ; update(x); FORK(L2); retrieve(x); update(y) FORK(L3) 1: 101N(count); retrieve(y); goto LO; L2: , goto L1; L3: goto LO; Consider also that section A1 is executed in 4 time units, section A2 - 6 time unites, section B1 -3 time units, section B2-5 time units. All other operations occupy 1 time unit. Trace the execution of the code showing the creation of the processes (basic threads) during the elapsed time (12 points)