The expected number of similar symbols between both the URLLC and eMBB blocks is \(\mu =\eta _{n,m}\,\zeta \) . Under the assumption that the eMBB blocks and the URLLC packet are \(i.i.d\) , and by searching over the search space (\(K_{m}=L_{m}-\zeta +1\) ), the order statistic after arranging the random samples in an increasing order is \(Y_{1} \le Y_{2 } \le \cdots \le Y_{K_{m} }\) . Based on the results of [1]}, the pmf of \(Y_{z }\)  becomes for all \(k=0,1, \ldots , \zeta \)
\(\begin{split}f_{z }(k)=\sum \nolimits _{r=z}^{K^{m}}\left(\begin{array}{c}{K^{m}} \\ {r}\end{array}\right)\left[\lbrace F(k)\rbrace ^{r}\lbrace 1-F(k)\rbrace ^{K_m-r}\right.\\ \left.-\lbrace F(k-1)\rbrace ^{r}\lbrace 1-F(k-1)\rbrace ^{K_{m}-r}\right].\end{split}\vspace{-7.22743pt} \) 
