Given this partial pseudocode for an N$-$ element Bounded Buffer, and ignoring syn$-$ chronization issues, which expression can one use to determine that the buffer is empty?A$.$ in $==$ outB. in $==0$ && out $==0$C$.($out $-$ in $+$ N$)\%$ N $==1$ D$.($in $-$ out $+$ N$)\%$ N $==1$ push$($Item item$)$ buffer$[$in$]=$ item in $=($in $+1)\%$ N Item pop$()$ item $=$ buffer$[$out$]$ out $=($out $+1)\%$ N return item