Use pseudo$-$code to write an algorithm that, if given a relatively small

integer M and an array of non$-$negative integers x$[1,...,$ n$]$ with each value x$[$i$]<$ M$,$ will

sort x in linear time. Note that duplicates are possible.

Describe the runtime of your algorithm using big$-$O notation.

And assume that n $>>$ M$,$ i$.$e$.,$ n is much greater than M$.$