In Peterson's solution to CSP (shown below for Pi), with processes Pi and Pj, if the flag[i]=true in Pi's code (and flag[j] = true in Pj's code) statement is removed, what are the consequences (if any)? Both flag[i] and flag[j] are initially set to FALSE.

a. Neither Pi nor Pj can enter their critical sections (Progress is violated)

b. Both Pi and Pj can enter simultaneously (violation of Mutual exclusion)

c. Pi keeps entering its critical section while Pj can never its critical section (Bounded waiting)

d. Pj keeps entering its critical section while Pi can never its critical section (Bounded waiting)

e. No consequence---flag variable is unnecessary

f. None of the above