I want the solution for this question with explaination please

This pseudo-code for a process and TestAndSet function, without any other assumptions, solves the critical section problem between N processes. function TestAndSet(boolean lock) {boolean initial = lock: lock = true; return initial;} Initial value of lock = FALSE; function Process(int N) {Repeat while(TestAndSet (lock)) no-op; critical .section lock = TRUE; remainder section until FALSE}