Question about critical section (lock & unlock) bakery's algorithm

(pt) Let "fetch_and increment(" be an instruction that atomically increase the value stored in a memory location by 1, and return the previous value. Given a predefined data type locktype and its initialization function LockInit() as shown below, complete the Lock() and Unlock() functions for solving critical section problem. (hint: it is similar to the concept of bakery algorithm). Explain your answer. int fetch_and_increment(int* ptr) { int value="ptr; *ptr= value + 1; return value; struct locktype { int ticketnumber; int turn; void LockInit(struct locktype* lock) { lock.ticketnumber = 0; lock.turn 0; void Lock(struct locktype* lock) { // YOUR CODE void Unlock(struct locktype* lock) { // YOUR CODE (pt) Let "fetch_and increment(" be an instruction that atomically increase the value stored in a memory location by 1, and return the previous value. Given a predefined data type locktype and its initialization function LockInit() as shown below, complete the Lock() and Unlock() functions for solving critical section problem. (hint: it is similar to the concept of bakery algorithm). Explain your answer. int fetch_and_increment(int* ptr) { int value="ptr; *ptr= value + 1; return value; struct locktype { int ticketnumber; int turn; void LockInit(struct locktype* lock) { lock.ticketnumber = 0; lock.turn 0; void Lock(struct locktype* lock) { // YOUR CODE void Unlock(struct locktype* lock) { // YOUR CODE