Suppose there are three threads P, Q and R, each of them has some sequential code sections and then updates a shared variable count, as shown in the below table. Define and initialize semaphores to solve the synchronization and the critical section problems. Assume that QS2 needs to be executed after PS1 and RS1, and PS2 and RS2 needs to be executed after QS2 / Semaphores and initial values PS10 Qs1 o RS1 ) PS2 0 QS20 RS2 ) count = count + 1 | count = count + 21 count = count - 5 t-count 5 Suppose there are three threads P, Q and R, each of them has some sequential code sections and then updates a shared variable count, as shown in the below table. Define and initialize semaphores to solve the synchronization and the critical section problems. Assume that QS2 needs to be executed after PS1 and RS1, and PS2 and RS2 needs to be executed after QS2 / Semaphores and initial values PS10 Qs1 o RS1 ) PS2 0 QS20 RS2 ) count = count + 1 | count = count + 21 count = count - 5 t-count 5