can you answer 5 and 6 please?

The first known correct software solution to the critical-section problem for two processes was developed by the Dutch mathematician Theodora's Dekker. The processes share the following variables: Boolean flag[2];//Both initially false int turn; The structure of process P_i(i = 0 or 1) is shown below. The other process is P(j = 1 or 0). Prove the algorithm shown below satisfies the following requirements for a critical section: At most one process can execute its critical section at a time. If multiple processes attempt to enter their critical sections at the same time, one process is guaranteed to be selected and move forward Once a process P has requested access to its critical section, there exists a bound on the number of times other processes will be allowed to access their critical sections before P is given access to its critical section. flag[i] = true; while (flag l() = = true) (If (turn = = j) flag[i] = false; while (turn = = j)//do nothing flag(i) = true;/critical section would be placed here */turn = J; flag[i] = false; while (true); Multithreading does not necessarily guarantee improved performance over single-threaded versions of the same program Provide one example of a type of program that would run faster with multiple threads than it would with one thread and one example of a type of program that would not run faster with multiple threads