Question 2 (5+5+5+5) a) How many processes would be created by the following code? for (int i = 1; i <= 5; ++ i) fork();

b) Give all possible outputs of the following program: int x = 0; // global // Thread 1 x = x + 2;

// Thread 2 x = x + 3;

// Thread 3 cout << x; c) Name the four necessary conditions for a deadlock. d) Which of the following scheduling algorithms may suffer from starvation? i. FIFO ii. RR iii. Priority Scheduling iv. SJF v. Multi-level Queue Scheduling