PLEASE READ THE PROBELM!!! I DO NOT NEED ANY CODE FOR THIS!!! I need to use the countring sort method on an alogrithm that sorts in a runtime of O(n+K) where k is the maximum element.

PLEASE SORT THE NUMBERS BELOW!!, using this runtime of O(n+k) steps in a table showing the iteration #, array aftermath, and what is being compared/swtiched

Problem 4. Counting Sort This algorithm does not compare elements among themselves, it counts them. The algorithm can sort numbers in O(n k) steps, where k is the maximum element. A few links for you to read: https:llen wikipedia orglwikiLCounting sort httpliwww.geeksforgeeks.orglcounting sortl https:LLwww.cs.usfca edukgalleslvisualization LCountingSort.html After the algorithm makes sense, I'd like you to sort numbers (4, 9, 2, 3, 7, 8, 1), using it. Show the resulting array after each step of the algorithm in a neat table format just like in earlier Cases