1.If the Pi wants to go into critical section,the algorithm will check whether Pj is in the critical section,if it is the Pi would not be allowed in.So the Mutual Exlusion is preserved.
2.If no process is executing in its critical section,once the algorithm starts it will set flag[i] or flag[j] be 'true'.So the Progress is satisfied.
3.As an example , once set flas[i] be 'true' then if the Pj is not in the critical section then Pi will enter its critical section so the bounded-waiting re