p1 will not be terminated/preempted for ever, (no semaphores here) it will run at some later stage and will execute x=0, so some other process can enter cs , and only one process will enter the cs as TSL is atomic op.
but we dont know which one will enter cs, hence starvation (no bounded waiting, order)