1) In the second attempt towards Dekker's algorithm, is starvation possible? If there are two processes and one processor and both processes want to enter the critical section, show how one of the processes could continually enter the critical section while the other is kept out.

 

2) In Peterson's Algorithm, if both processes want to enter the critical section, what keeps starvation from occuring?

That looks familiarly like a homework problem to me. Don't expect us to do your homework for you