Refer to the Readers Writers problem shown in the code below.

typedef struct $\_$rwlock$\_$t $\{$

sem$\_$t lock; $//$ binary semaphore $($basic lock$)$

sem$\_$t writelock; $//$ allow ONE writer$/$MANY readers

int readers; $//$ #readers in critical section

rwlock$\_$t;

void rwlock$\_$init$($rwlock$\_$t $*$rw$)$

rw$->$readers $=0$;

sem$\_$init$($&rw$->$lock, $0,1)$;

sem$\_$init$($&rw$->$writelock, $0,1)$;

$\}$

void rwlock$\_$acquire$\_$readlock$($rwlock$\_$t $*$rw$)\{$

sem$\_$wait$($&rw$->$lock$)$;

rw$->$readers$++$;

if $($rw$->$readers $==1)//$ first reader gets writelock

sem$\_$wait $($&rw$->$writelock$)$;

sem$\_$post$($&rw$->$lock$)$;

$\}$

void rwlock$\_$release$\_$readlock$($rwlock$\_$t $*$rw$)\{$

sem$\_$wait $($&rw$->$lock$)$;

rw$->$readers$--$

if $($rw$->$readers $==0)//$ last reader lets it go

sem$\_$post $($&rw$->$writelock$)$;

sem$\_$post$($&rw$->$lock$)$;

$\}$

void rwlock$\_$acquire$\_$writelock$($rwlock$\_$t $*$rw$)\{$

sem$\_$wait$($&rw$->$writelock$)$;

$\}$

void rwlock$\_$release$\_$writelock $($rwlock$\_$t $*$rw$)\{$

sem$\_$post$($&rw$->$writelock$)$;

$\}$

A Writer process W$1$ starts its execution and currently is in Critical Section $($CS$)$ after the steps $1,2$ and $3$ occur in order.

Step $1$: Writer process W$2$ is trying to access CS

Step $2$: Reader process R$1$ is trying to access CS

Step $3$: Reader process $R2$ is trying to access CS

What is the final value of semaphore variable lock, writelock, and variable readers $($You MUST show

your work; template to show the work$)$