The following algorithm is proposed to solve the critical section problem between two processes P$1$ and P$2,$ where lock is a shared variable.

while$($TRUE$)\{$

while $($lock$)\{$ NULL;$\}$

lock $=$ TRUE;

$...$critical section;

lock $=$ FALSE;

$...$reminder section;

$\}$

Which of the following statements is true regarding the proposed algorithm?

Group of answer choices

Both processes can be in their critical section at the same time.

None of the mentioned.

Mutual exclusion to the critical section is guaranteed.

Lock should be initialized as TRUE.