Given a number of elements in the range [0….n3]. Which of the following sorting algorithms can sort them in O(n) time? Data Structures 4 July 20204 July 2020StudyBlocksLeave a Comment on Given a number of elements in the range [0….n3]. Which of the following sorting algorithms can sort them in O(n) time?a) Counting sortb) Bucket sortc) Radix sortd) Quick sort