Exercise 3 Consider m updater processes and n browser processes concurrently accessing a database in a multiprogrammed operating system, using the pseudocode in the figure below: int count0 semaphore s.db(1) semaphore s.count(1) shared void browser void updater P(s.db) /update db (s.db) P(s.count count++; if (count -1) P(s.db) V(s.count) browse db P(s.count); count–; f (count0) V(s.db); V(s.count) Briefly discuss the following questions about the solution above (do not just answer “yes” or “no”) 1. If an updater is updating, in
OR
OR