Problem 5: a) Describe how the compare_and_swap() instruction can be used to provide mutual exclusiorn that satisfies the bounded-waiting requirement. Consider how to implement a mutex lock using an atomic hardware instruction. Assume that the following structure defining the mutex lock is available b) typedef struct f int available; oc where (available 0) indicates the lock is available; a value of 1 indicates the lock is unavailable Using this struct, illustrate how the following functions may be implemented using the test_and_set() and compare_and_swap nstructions. void acquire(lock mutex) void release(lock *mutex) Be sure to include any initialization that may be necessary c) Show how to implement the wait() environments using test and wait?ng and signal() semaphore operations in multiprocessor instruction. The solution should exhibit minimal busy set() Problem 5: a) Describe how the compare_and_swap() instruction can be used to provide mutual exclusiorn that satisfies the bounded-waiting requirement. Consider how to implement a mutex lock using an atomic hardware instruction. Assume that the following structure defining the mutex lock is available b) typedef struct f int available; oc where (available 0) indicates the lock is available; a value of 1 indicates the lock is unavailable Using this struct, illustrate how the following functions may be implemented using the test_and_set() and compare_and_swap nstructions. void acquire(lock mutex) void release(lock *mutex) Be sure to include any initialization that may be necessary c) Show how to implement the wait() environments using test and wait?ng and signal() semaphore operations in multiprocessor instruction. The solution should exhibit minimal busy set()