Question $2-$ Context Switch $(22$ points$)$

$($This question is related to ILO$2-$ "explain the principles behind the core function: Process Management",

and ILO$4-$ "demonstrate knowledge in applying system software and tools".$)$

Consider a single$-$core computer with only $2$ user processes P$1$ and P$2.$ The OS employs a

priority$-$based scheduling policy and selects the process of the highest priority to run whenever it

has a chance to schedule. P$1$ has a higher priority than P$2.$ Assume P$1$ is currently running and P$2$

is in the ready queue. Further assume the machine doesn't have a timer device for timer interrupts

and all the system calls are successful. Answer the following questions.

Consider that P$1$ makes a system call to read a file from the disk. Describe the major OS

behaviors from when the system call is made to the time when the call completes and returns.

Write down the key events $($e$.$g$.,$ mode switches, context switches, etc$)$ as bullet points.

Assume P $2$ is a process with the following pseudo code. When P $2$ is scheduled to run, what

would be the possible resulting values of x upon the completion of P$2?$ Please explain your

answer.

int x $=0$;

void func$1($void$)$

$\{$

for $($int k $=0$; k $<mtext></mtext><mn>1</mn><mn>0</mn>$; k$++)$

x$++$;

$\}$

int main$()$

$\{$

x$++$;

int pid $=$ fork$()$;

func$1()$;

return $0$;

$\}$

Following $2)$ and given the above settings, do you think P $2$ would run to completion without

being de$-$scheduled once it starts executing on the CPU $($i$.$e$.,$ the first time it is scheduled$)?$

Why or why not?