to the code below by using javaScript!

Compare two approaches to partition in quickselect: Sedgewick and Lumoto . Assume that the numbers range from 0 to 100. Use the recursive version of quickselect. Always select the median at |1+r/2|Regardless of even/odd array size.
you must collect both operation count and timing data. Check if both measurements do indeed have the same order of growth.

please read it carfully and solve it by folowing all the requiremnts