Consider two cooperating processes P5 and P6. Suppose that, at any time, P6 want to enter its critical section. Write an algorithm using Petersons solution which shows that P6 can finally enter into its criticalsection. Consider the turn value for P5 to be 10 and P6 to be 12.