Please answer this

10. Assume that you want to sort an array of n numbers, each of which is a member of the set f0, 1, 2, 3, 4). A sample input for n 6 is (3, 1, 0, 3, 4, 3). Describe an optimal algorithm (either code or in English) to solve this problem and prove that it is optimal; that is give a lower bound on the worst-case running time that has the same order of magnitude as the worst-case running time of your algorithm. (10 points)