2.5. Suppose that we switch the order of the first two statements in Peterson's algorithm: boolean intendToEnter 0 = false, intend ToEnter 1 = false; int tarn: // no initial value for tant is needed. Does the modified solution guarantee mutual exclusion? Explain. If yes, does the modified solution guarantee progress and bounded waiting? Explain. 2.7. For the bakery algorithm in Section 2.2.2, the value of number/il is not bounded. (a) Explain how the value of numberiil grows without bound. (b) One suggestion for bodnding the value of namber/i] is to replace the statement number[i] =max( number )+1 : with the statement U mumThreads is of threads in the program number[i] =(max( aumber )+1) \% numThreads: Is this suggestion correct? Explain