Suppose we are given a sequence of n elements, each of which is an integer in the range [0, n2 -1]. Describe a simple method for sorting S in O(n) time. Hint: Think of alternative ways of viewing the elements. Kindly use a different sequence of numbers than { 10, 0 , 13, 7 ,12 }