Q28

Consider the two functions $\textsf{incr}$ and $\textsf{decr}$ shown below. incr(){ decr(){ wait(s); wait(s); X = X+1; X = X-1; signal(s); signal(s); } } There are $5$ threads each invoking $\textsf{incr}$ once, and $3$ threads each invoking $\textsf{decr}$ once, on the same shared variable $\mathrm{X}$. The initial value of $\mathrm{X}$ is $10.$ Suppose there are two implementations of the semaphore $\text{s},$ as follows: $\textbf{I-1:} \;\mathrm{s}$ is a binary semaphore initialized to $1.$ $\textbf{I-2:}\; \mathrm{s}$ is a counting semaphore initialized to $2.$ Let $\text{V1, V2}$ be the values of $\text{X}$ at the end of execution of all the threads with implementations $\textbf{I-1, I-2},$ respectively. Which one of the following choices corresponds to the minimum possible values of $\text{V1, V2},$ respectively?