3. 33 points Prove or disprove that the following code a solution to the critical section problem for 2 processes. Process is the same just replacing i with j. boolean lock=FALSE 7 Processi dol waiting[i]= TRUE; key = TRUE; while(waiting[i] &&key) key = conpare_and_swap(&lock, FALSE, TRUE)/* uninterruptable function */ waitingli] = FALSE; 1 Critical Section If (waiting6l == TRUE) waiting til = FALSE: else lock = FALSE; /* Remainder Section 1 while (TRUE)