Consider the following Boolean expression

$W(i,j,k)=i(j^{\text{'}}+k)$

Convert this expression to a sum of products $($SoP$)$ in which every minterm contains all the input literals and where there is no repeating minterm

Good news! I'll do the conversion for you, you just have to match the step to the name of property to get to that step

$W=i{j}^{\text{'}}+ik$

$[$Choose$]$

$[$Choose$]$

$W=i{j}^{\text{'}}(k+k^{\text{'}})+ik(j+j^{\text{'}})$

Distributive Law $2$

Distributive Law

Associative Law to reorganize each literal and minterms

$W=i{j}^{\text{'}}k+ij{j}^{\text{'}}+$ikj$+ik{j}^{\text{'}}$

Complementary Law for $k$ and for $j$

Idempotent Law to elminate repeats

$[$Choose$]$

$W=i{j}^{\text{'}}{k}^{\text{'}}+i{j}^{\text{'}}k+i{j}^{\text{'}}k+$ijk

$W=i{j}^{\text{'}}{k}^{\text{'}}+i{j}^{\text{'}}k+$ijk