Its a thoery question,not coding Kindly do as required Your help will me highly appriciated

2. In an operating system program's 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, [10 Marks) B: PT1 PT PTS B: pT4 PT2 PT3 B. pT1 PTS PT3 PTG B. PT1 PTS BIpTS PT6 ByIpT6I B. PTS PT3 PT2 6 2. In an operating system program's 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, [10 Marks) B: PT1 PT PTS B: pT4 PT2 PT3 B. pT1 PTS PT3 PTG B. PT1 PTS BIpTS PT6 ByIpT6I B. PTS PT3 PT2 6