Just Problem 3 please

Problem 2: On input an array A of n elements, each of which is an integer in (0.3), describe a simple method for sorting A in O(n) time. Hint: think of alternative ways of viewing the elements Problem 3: Given a set S of n elements its r-percentiles are defined as the values in S that divide the sorted version of S in 10 sets of equal size (plus or minus 1). For example the 20-percentile values are the values that divide the sorted version of S in 5 equal size sets. Example: S 12,3,6,9,15,4, 1, 19,21,8, 13 has n 11 elements. Its sorted version is Sorted S) Describe an algorithm that finds the r-percentiles in O(n log k) time. 1,3,4,6,8,9,12, 13, 15, 19, 21]. The 20-percentiles are (3,6,9, 13,21)