create a c$++$ code snippet that is the desired part of the code excluding any unessasary couts Define a function

void babySort$($int nums$[],$ int length$)$

that uses the baby sort: algorithm. That means we may assume that nums contains only "baby" values in the range $[0.\mathrm{.}99].$ Rather than swap or shift elements in place like for other sorting algorithms, we will use a local array counts of size $100$ to count occurences of each value within array nums. Then we will overwrite nums with the same values in order based purely on the information in counts.

You must do the sorting this way to receive credit. Even if CodeLab accepts it you'll only get credit if your algorithm conforms to the instructions.