In an operating system programs memory management of processes, each process consists of Threads that are allocated shared memory spaces called Buffer Memory. An empty buffer is allocated a certain number threads and then becomes full when the multiple threads are executed to store the data objects. Finally, the process executes a callback to retrieve the data from any available full buffer. Using the concepts of Equivalence Relations, explain how many callbacks routines the program needs to perform if the buffers can be processed concurrently with the restriction that a thread is only executed in the assigned buffers one at a time. Use the following buffer memory allocations.

B1 pT1 pT4 pT5

B2 pT4 pT2 pT3

B3 pT5 pT6

B4 pT5 pT3 pT2

B5 pT1 pT5 pT3 pT6

B6 pT1 pT5

B7 pT6

B8 pT4 pT1 pT3 pT6