This is for Operating Systems Concepts...

This a counter with locks (slides concurrent-with-data structures). Explain why makes the nice implementation of a simple counter inefficient and slow in a context of several CPUs?. a. 1typedef struct counter t valuei int pthread mutex_t lock; 4 Counterti init (counter-t c->value-0 Pthread mutex init (&c->lock, NUI void ?c; 10 1 void increment (counter t c) 12 13 14 15 16 17 void decrement (counter t c) 18 19 Pthread mutex lock (&c->lock) i c->value++ Pthread mutex unlock (&c->lock) i Pthread mutex lock (&c-lock) c->value--i Pthread mutex unlock (&c->lock) 21 23 int get (countertc) ( Pthread mutex lock (&c->lock) int rcC->value; Pthread mutexunlock(&c->lock) return rc; 26 28 b. Why a sloppy counter is faster c. Explain the tread-off between the accuracy (sloppiness) and the speed of the counter