pleaae answer rhe question thanks .

For the following lock implementation: Typedef struct bool lock = false; bool guard = false; queue_tq; } LockT; void acquire(LockT *D) { while (TAS(&l->guard, true)); if (1->lock) { qadd(i->q, tid); set_block(); // notify of plan |-> guard = false; block0:// unless wakeup 1 else 1->lock - true; 1-guard = false; } void release(LockT *l) { while (TAS(&l->guard, true)); if (qempty(l->q)) I->lock=false; else wakeup(qremove(l->q)); |->guard = false; } Please explain (a) why a queue_t is needed in LockT? And (b) what kind of queue implementation is suitable for queue_t and why