Violation table for child's system

$\backslash$table$[[$Inpuls$,$Oupluls,${?}^{**CC},$MSR$,$NoSkipping,NoDel$-$V$,$NoDel$-$C$,$NoDiph$],[/$ski$/,$ski,,,,,,$],[>ki,,,,,,],[$si$,,,,,,],[/$snow$/,$snow,,,,,,$],[>$ so$,,,,,,],[$no$,,,,,,],[$sno$,,,,,,],[$sow$,,,,,,]]$

Part $2.(10$ points$)$ Next, assume that the child's outputs are winners, and build a Winner$-$Loser table for the above data. Each cell must have a $\text{'}$W$\text{'}(=$above constraint favors the winner$),$ a $\text{'}$L$\text{'}($favors the loser$),$ or $\text{'}e\text{'}($constraint says nothing$).$ When you have filled in all the cells, and checked them, use Recursive Constraint Demotion to show the child's constraint ranking. Give your answer below. If some constraints are not ranked with respect to each other that is okay $-$just put them in a single unordered stratum $\{\}.$

Winner$-$Loser table for child's system

$\backslash$table$[[$Inputs$,$Winner $$ Loser,${?}^{**}$ CC$,$MSR$,$NoSkipping,NoDel$-$V$,$NoDel$-$C$,$NoDiph$],[/$ski$/,$ki $$ ski,,,,,,$],[,$ki $$ si$,,,,,,],[/$snow$/,$so $$ sno,,,,,,$],[,$so $$ no$,,,,,,],[,$so $$ sow,,,,,,$],[,$so $$ snow,,,,,,$]]$

Child's ranking: